Lesson 7 of 81965–today8 min
The memory hierarchy and caches
In April 1965 Maurice Wilkes of Cambridge published a two-page note in the IEEE Transactions on Electronic Computers. He proposed placing a small, fast memory, which he called a slave, in front of the large main memory, and keeping in it the words the processor had used recently. Most accesses would find their data in the slave; only the rest would pay the full price of main memory.
The word cache came into use a few years later. Today a processor core spends more time and silicon on its caches than on arithmetic, because the gap Wilkes saw has grown to roughly a hundred processor cycles for every trip to DRAM.
The rest of this lesson is part of Pro
Create a free account to read the first lesson of every path, and go Pro for the rest.
Sources
- Slave Memories and Dynamic Storage Allocation (M. V. Wilkes, IEEE Transactions on Electronic Computers EC-14(2), 1965) — Department of Computer Science and Technology, University of Cambridge
- Maurice Wilkes Introduces Memory Caching — History of Information
- CS 61C: Great Ideas in Computer Architecture (machine structures) — University of California, Berkeley