The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Speculative versioning cache
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,375
Sohi, G. S., Breach, S. E., & Vijaykumar, T. N. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.224451 · Cited by 971
Self-citationThe case for a single-chip multiprocessor
Olukotun, K., Nayfeh, B. A., Hammond, L., Wilson, K., & Chang, K.-Y. K. (1996) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/237090.237140 · Cited by 754
TreadMarks: distributed shared memory on standard workstations and operating systems
Keleher, P. J., Cox, A. L., Dwarkadas, S., et al. (1994) · Cited by 635
The Midway distributed shared memory system
Bershad, B. N., Zekauskas, M. J., & Sawdon, W. (2002) · IEEE Computer Society International Conference (COMPCON Spring) · doi:10.1109/cmpcon.1993.289730 · Cited by 445
Data speculation support for a chip multiprocessor
Hammond, L., Willey, M., & Olukotun, K. (1998) · Proceedings of the eighth international conference on Architectural support for programming languages and operating systems · doi:10.1145/291069.291020 · Cited by 415
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1998) · doi:10.1145/285930.285984 · Cited by 395
Using cache memory to reduce processor-memory traffic
Goodman, J. R. (1983) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/800046.801647 · Cited by 307
ARB: a hardware mechanism for dynamic reordering of memory references
Franklin, M., & Sohi, G. S. (1996) · IEEE Transactions on Computers · doi:10.1109/12.509907 · Cited by 259
Self-citationStructural aspects of the System/360 Model 85, II: The cache
Liptay, J. S. (1968) · IBM Systems Journal · doi:10.1147/sj.71.0015 · Cited by 236
Cited by
Transactional Memory Coherence and Consistency
Hammond, L., Wong, V., Chen, M., Carlstrom, B. D., Davis, J. D., Hertzberg, B., Prabhu, M. K., Wijaya, H., Kozyrakis, C., & Olukotun, K. (2004) · ACM SIGARCH Computer Architecture News · doi:10.1145/1028176.1006711 · Cited by 643
Data speculation support for a chip multiprocessor
Hammond, L., Willey, M., & Olukotun, K. (1998) · Proceedings of the eighth international conference on Architectural support for programming languages and operating systems · doi:10.1145/291069.291020 · Cited by 415
A scalable approach to thread-level speculation
Steffan, J. G., Colohan, C. B., Zhai, A., & Mowry, T. C. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339650 · Cited by 392
Smart Memories: a modular reconfigurable architecture
Mai, K., Paaske, T., Jayasena, N., Ho, R., Dally, W. J., & Horowitz, M. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339673 · Cited by 371
The potential for using thread-level data speculation to facilitate automatic parallelization
Steffan, J. G., & Mowry, T. C. (2002) · Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.1998.650541 · Cited by 345
DMP: deterministic shared memory multiprocessing
Devietti, J., Lucia, B., Ceze, L., & Oskin, M. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508255 · Cited by 328
Metadata
- Authors
- Gopal, S., Vijaykumar, T. N., Smith, J. E., & Sohi, G. S.
- Venue
- Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 195-205
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W1525227808
- Cited by
- 254
- References
- 11
- FWCI
- 16.97
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.