Computers and Technology, 10.05.2021 19:30 awdadaddda

Consider a pipelined processor with just one level of cache. Assume that in the absence of memory delays, the baseline CPI of this processor is 2. Now assume that the percentage of memory instructions in a typical program executed on this CPU is 50% and the memory access latency is 150 cycles. Assuming that the I-cache delays are already accounted for in the baseline CPI, consider the following two alternatives for the D-cache design: Alternative 1: A small D-cache with a hit rate of 94% and a hit access time of 1 cycle (assume that no additional cycles on top of the baseline CPI are added to the execution on a cache hit in this case).
Alter tive 2: A larger D-cache with a hit rate of 98% and the hit access time of 2 cycles (assume that every memory instruction that hits into the cache adds one additional cycle on top of the baseline CPI).
a) [5%] Estimate the CPI metric for both of these designs and determine which of these two designs provides better performance. Explain your answers
b) [5%] Repeat part (a), but now assume that the memory access latency is reduced to 50 cycles.
c) [5%] Repeat part (b), but now assume that the L2 cache is also added to the system with the hit rate of 75% and access latency of 10 cycles.

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 22.06.2019 20:40

Assume that there is a 4% rate of disk drive failure in a year. a. if all your computer data is stored on a hard disk drive with a copy stored on a second hard disk drive, what is the probability that during a year, you can avoid catastrophe with at least one working drive? b. if copies of all your computer data are stored on three independent hard disk drives, what is the probability that during a year, you can avoid catastrophe with at least one working drive?

Answers: 1

Answer

Computers and Technology, 22.06.2019 23:00

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below

Answers: 2

Answer

Computers and Technology, 23.06.2019 18:30

Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.

Answers: 3

Answer

Computers and Technology, 24.06.2019 15:00

Who introduced the concept of combining artificial and natural light in the studio

Answers: 1

Answer

You know the right answer?

Consider a pipelined processor with just one level of cache. Assume that in the absence of memory de...

Questions