
The Essentials Of Computer Organization And Architecture 4th Edition by Linda Null,Julia Lobur
Edition 4ISBN: 978-1284074482
The Essentials Of Computer Organization And Architecture 4th Edition by Linda Null,Julia Lobur
Edition 4ISBN: 978-1284074482 Exercise 6
A direct mapped cache consists of 8 blocks. Byte-addressable main memory contains 4K blocks of 8 bytes each. Access time for the cache is 22ns, and the time required to fill a cache slot from main memory is 300ns. (This time allows us to determine that the block is missing and bring it into cache.) Assume that a request is always started in parallel to both cache and to main memory (so if it is not found in cache, we do not have to add this cache search time to the memory access). If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.
a) Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes.
b) Compute the hit ratio for a program that loops 4 times from addresses 0x0 to 0x43 in memory.
c) Compute the effective access time for this program.
a) Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes.
b) Compute the hit ratio for a program that loops 4 times from addresses 0x0 to 0x43 in memory.
c) Compute the effective access time for this program.
Explanation
a)
This is a direct mapped cache. Since ...
The Essentials Of Computer Organization And Architecture 4th Edition by Linda Null,Julia Lobur
Why don’t you like this exercise?
Other Minimum 8 character and maximum 255 character
Character 255