Computer Architecture and Organization

6. Additional cycles required to serve the miss.
7. A small unit of physical memory space.
8. A page replacement algorithm.
12. It must decide which page in main memory ought to be removed to make a new room for a new page.
13. Permits the user to construct programs as though a large memory space were available.
14. A cache like quick reference for page table.
15. Single bit error correction method.
19. Items whose addresses are near one another tend to be referenced close together in time.
20. A type of RAM that consists of circuits that are capable of retaining their state as long as the power is applied.

1. Replace that block in the set that has been in the cache longest with no reference to it.
2. Time to retrieve the first word of the block.
3. Any block location in cache can store any block in memory.
4. Each word of cache can store 2 or more words of memory under the same index address.
5. We can predict with reasonable accuracy what instructions and data a program will use in the near future based on its accesses in the recent past.
9. Memory is not up-to-date, i.e., the same item in cache and memory may have different value.
10. Cache memory is updated in parallel if it contains the word at the specified address.
11. Map An address map indicating memory component and address bus representation.
16. A type of buffer register.
17. Secondary cache in multilevel cache architecture.
18. A referenced item is found in the cache by the processor.