Hierarchical memory is the combination and structure of memory to increase performance and lower disparity of memory inequalities.
The three basic types of locality are temporal, spatial, and sequential locality.
The value bit equals 1 when there is a cache hit.
During the replacement policy, first-in, first out algorithm, the first block becomes the victim block and removed first from the cache memory.
Hash values are stored on the has tables.
Strictly inclusive cache refers to data found on the previous level, is found on the lower ones.
Paging starts off by translating a virtual address to a physical address.
Segments have there boundaries and base address.
Consider MIPS memory management, MIPS cache memory works with boot code. Combination of mapped, unmapped, uncached, cache, and user space.
Programmed I/O is a control method.
