High-bandwidth data memory systems for superscalar processors
Gurindar S. Sohi, Manoj Franklin · 1991
This paper considers the design of a data memory hierarchy, with a level 1 (L1) data cache at the top, to support the data bandwidth demands of a future-generation superscalar processor capable of issuing about ten instructions per clock cycle.It introduces the notion of cache bandwidfh -the bandwidth with which a cache can accept requests from the processor -and shows how the bandwidth of a standard, blocking cache, can degrade greatly because of its inability to overlap the service of misses.Non-blocking or lockup-free caches are discussed as a way of reducing the bandwidth degradation due to misses.To improve the data bandwidth to greater than 1 request per cycle, multi-port, interleaved caches are introduced.Simulation results from a cycle-by-cycle simulator, using the MIPS R2000 instruction set, suggest that memory hierarchies with blocking L 1 caches will be unable to support the bandwidth demands of futuregeneration superscalar processors.Multi-port, nonblocking (MPNB) L1 caches introduced in this paper for the top of the data memory hierarchy appear to be capable of supporting such data bandwidth demands.
Cited by 217 works. doi:10.1145/106972.106980 Open-access PDF
Authors
References
- Cache Memories
- Improving direct-mapped cache performance by the addition of a small fully-associative cache prefetch buffers
- Using cache memory to reduce processor-memory traffic
- Using cache memory to reduce processor-memory traffic
- Lockup-free instruction fetch/prefetch cache organization
- Available instruction-level parallelism for superscalar and superpipelined machines
- Instruction issue logic for high-performance, interruptible, multiple functional unit, pipelined computers
- Highly concurrent scalar processing
- Available instruction-level parallelism for superscalar and superpipelined machines
- Microprocessors circa 2000