indianj
10-28-2005, 03:03 PM
Hello everyone, I am taking, Discovering computer class and I was doing my practice exam, I came across this exercise and I do not have any idea how to solve it. If anyone know anything about, please post your help here.
A direct mapped cache consists of 128 slots. Main memory contains 16K blocks of 16 words each. Access time of the cache is 10 ns, and the time required to fill a cache slot is 200 ns. Load-through is not used; that is, when an accessed word is not found in the cache, the entire block is brought into the cache, and the word is then accessed through the cache. Initially, the cache is empty. Note: When referring to memory, 1K = 1024.
(a) Show the format of the memory address.
(b) Compute the hit ratio for a program than loops 10 times from locations 15 to 200. Note that although the memory is accessed twice during a miss (once for the miss, and once again to satisfy the reference), a hit does not occur for this case. To a running program, only a single memory reference is observed.
(c) Compute the effective access time for this program.
A direct mapped cache consists of 128 slots. Main memory contains 16K blocks of 16 words each. Access time of the cache is 10 ns, and the time required to fill a cache slot is 200 ns. Load-through is not used; that is, when an accessed word is not found in the cache, the entire block is brought into the cache, and the word is then accessed through the cache. Initially, the cache is empty. Note: When referring to memory, 1K = 1024.
(a) Show the format of the memory address.
(b) Compute the hit ratio for a program than loops 10 times from locations 15 to 200. Note that although the memory is accessed twice during a miss (once for the miss, and once again to satisfy the reference), a hit does not occur for this case. To a running program, only a single memory reference is observed.
(c) Compute the effective access time for this program.