In-class probs Cache

In-class probs Cache - Computer Architecture CSC 520 Cache...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Architecture CSC 520 Cache Problems 1.Assume you have 64 blocks of cache memory, into which block or blocks of cache could main memory block 57 possibly be placed ( assume cache and memory blocks are numbered from zero ) if cache is: a. direct mapped b. fully associative c. 4-way set associative d. 8-way set associative e. Can you explain three cache replacement policies? 2.Assume the instruction execution cycle on your machine could be divided into the following functions which require the amount of time indicated : IF….9ns, ID…. .7ns, EX…. .12 ns. Assume pipeline overhead is 2ns. What would be the cycle time on the unpipelined machine? What would be the cycle time on the pipelined machine? What would be the (ideal) speedup due to pipelining? 3.What is Amdahl’s Law? 4. Given a computer that requires 400 seconds to execute a particular program, the machine spends 60% of its time on floating point operations, 30 % on integer operations, and 10 % on string manipulation. If you improve one of the operations by a factor of 10, which would you
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/10/2012 for the course CSC 520 taught by Professor Simmons during the Fall '07 term at S. Alabama.

Page1 / 3

In-class probs Cache - Computer Architecture CSC 520 Cache...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online