Speculative versioning cache
S. Gopal, T. N. Vijaykumar, James Edward Smith et al. · Proceedings - International Symposium on High-Performance Computer Architecture/Proceedings · 2002
Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively executed before the addresses of all preceding loads and stores are known. Furthermore, multiple speculative stores to a memory location create multiple speculative versions of the location. Program order among the speculative versions must be tracked to maintain sequential semantics. A previously proposed approach, the address resolution buffer (ARB) uses a centralized buffer to support speculative versions. Our proposal, called the speculative versioning cache (SVC), uses distributed caches to eliminate the latency and bandwidth problems of the ARB. The SVC conceptually unifies cache coherence and speculative versioning by using an organization similar to snooping bus-based coherent caches. A preliminary evaluation for the multiscalar architecture shows that hit latency is an important factor affecting performance, and private cache solutions trade-off hit rate for hit latency.
Cited by 254 works. doi:10.1109/hpca.1998.650559
Authors
References
- Computer Architecture: A Quantitative Approach
- Structural aspects of the System/360 Model 85, II: The cache
- Using cache memory to reduce processor-memory traffic
- Using cache memory to reduce processor-memory traffic
- Multiscalar processors
- The case for a single-chip multiprocessor
- Complexity-effective superscalar processors
- Advanced performance features of the 64-bit PA-8000
- TreadMarks: distributed shared memory on standard workstations and operating systems
- High-bandwidth data memory systems for superscalar processors