The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
ARB: a hardware mechanism for dynamic reordering of memory references
Abstract
To exploit instruction level parallelism, it is important not only to execute multiple memory references per cycle, but also to reorder memory references-especially to execute loads before stores that precede them in the sequential instruction stream. To guarantee correctness of execution in such situations, memory reference addresses have to be disambiguated. This paper presents a novel hardware mechanism, called an Address Resolution Buffer (ARB), for performing dynamic reordering of memory references. The ARB supports the following features: (1) dynamic memory disambiguation in a decentralized manner, (2) multiple memory references per cycle, (3) out-of-order execution of memory references, (4) unresolved loads and stores, (5) speculative loads and stores, and (6) memory renaming. The paper presents the results of a simulation study that we conducted to verify the efficacy of the ARB for a superscalar processor. The paper also shows the ARB's application in a multiscalar processor.
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
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-citationAlternative Implementations of Two-Level Adaptive Branch Prediction
Yeh, T.-Y., & Patt, Y. N. (1992) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/139669.139709 · Cited by 541
Cited by
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-citationTransactional 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
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
Gopal, S., Vijaykumar, T. N., Smith, J. E., & Sohi, G. S. (2002) · Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.1998.650559 · Cited by 254
Self-citationSpeculative execution in a distributed file system
Nightingale, E. B., Chen, P. M., & Flinn, J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095829 · Cited by 94
Metadata
- Authors
- Franklin, M., & Sohi, G. S.
- Venue
- IEEE Transactions on Computers
- Published
- 1996-05
- Volume
- 45
- Issue
- 5
- Pages
- 552-571
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2131867938
- Cited by
- 259
- References
- 2
- FWCI
- 29.31
- Type
- journal article
- 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.