Given six memory spaces (holes): 400KB, 500KB, 900KB, 100KB, 300KB and 600KB as shown in the given diagram. How would each of First-Fit, Best-Fit and Worst-Fit algorithms place processes of P1:500KB, P2:400KB, P3: 100KB, P4: 300KB and P5: 200KB? Which algorithm makes the most efficient use of memory? 400KB | 500KB | 900KB | 100KB | 300KB | 600KBs 0, 400 , 900 , 1800 , 1900 , 2200, 2800

Given six memory spaces (holes): 400KB, 500KB, 900KB, 100KB, 300KB and 600KB as shown in the given diagram. How would each of First-Fit, Best-Fit and Worst-Fit algorithms place processes of P1:500KB, P2:400KB, P3: 100KB, P4: 300KB and P5: 200KB? Which algorithm makes the most efficient use of memory? 400KB | 500KB | 900KB | 100KB | 300KB | 600KBs 0, 400 , 900 , 1800 , 1900 , 2200, 2800

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

Given six memory partitions of 250 KB, 60 KB, 115 KB, 300 KB, 460 KB and 570KB (in order). How would the first-fit, best-fit and worst-fit algorithms place process of size 300 KB? Select one: a. 300 KB, 460 KB, 570 KB b.300 KB, 300 KB, 570 KB c.250 KB + 50 KB from 60 KB, 300 KB, 570 KB d.250 KB + 50 KB from 60 KB, 300 KB, 460 KB
Given five memory partitions of 150Kb,550Kb,250Kb,350Kb,600Kb(inorder),how would the first-fit,best-fit,and worst-fit algorithm splace processes of 202Kb,427Kb,122Kb,and426Kb(inorder)?
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order),how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 212KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?
Given fixed partition memory: 200K, 600K, 300K, 400K and 700K (in order). How would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 315K, 515K, 215K, and 525K(in order)? )
4. Consider a system which has logical address is 7 bits, physical address is 6 bits calculate the number of pages and no.of frames. 5. Given Memory partition of 110,510K,210K and310kand600kin that order show how each of the best-fit, worst-fit and first-fit algorithms place process of221,471,112and 426 in that order in memory.
A superscalar computing system with the 2nd degree of Superscalar and with 3 processing units. The instructions are: I1: Require 2 execution cycles I2: Require 4 execution cycles I3& I4: Conflict for resources I3& I4: Require 2 execution cycles I5: Data dependency on I4 I6 to I9: No constraints Analyze the performance of this system in terms of clock cycles count for the following three cases. In-order issue and In-order completion In-order issue and out-of-order completion Out-of-order issue and out-of-order completion
If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
Consider two processors P1 and P2. P1 has a clock rate of 2 GHz, average CPI of 0.8, and requires the execution of 5.0 x 10^9 instructions for a given task. P2 has a clock rate of 3 GHz, an average CPI of 1.2, and requires the execution of 6.0 x 10^9 instructions for the same task. Does the processor with the highest clock rate have a better performance? Justify your answer.
The functions n2 and 2n, respectively, are used to describe the temporal complexity of the two algorithms A and B. They must be carried out on machine M, which takes 10-6 s to complete one instruction. How long does it take the algorithms to finish running on machine A with a 50-item input? What is the biggest input size that the two algorithms on machine N can handle if a different machine N that is 10 times quicker than machine M is used for the execution? What conclusions have you drawn?
Consider a group of 5 benchmarks. With an old generation of CPU in the 90s, the execution times of these benchmarks were 10 minutes, 16 minutes, 4 minutes, 1 minute and 8 minutes. With a new generation of CPU in 2020, the execution time of these benchmarks are 5 minutes, 2 minutes, 2 minutes, 15 seconds and 1 minutes. What is the average speedup of the new CPU (comparing to the old CPU)? Note that, you need to determine whether arithmetic mean or geometric mean should be used here.
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz.Computer B has a CPI of 2.5 and can be run at a clock rate of 750 Mhz. Wehave a particular program we wish to run. When compiled for computer A, thisprogram has exactly 100,000 instructions. How many instructions would theprogram need to have when compiled for Computer B, in order for the twocomputers to have exactly the same execution time for this program?
A CPU has an instruction pipeline with the following 4 segments. 1.F1(Fetch Instruction) 2.DA(Decode, Address) 3.FO(Fetch Operand) 4.EX(Execution) D1: Add R1,R2 //R1=R1+R2 Add R4,R1 //R4=R4+R1 Add R4,R3 //R4=R4+R3 Cmp R4,R5 // compare R4 and R5 Jg D1 //if Jump Greater (if R4>R5) Sub R2,R1 //R2=R2-R1 Sub R2,R3 //R2=R2-R3 Jmp D1