The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Multiscalar processors
Abstract
Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks are distributed to a number of parallel processing units which reside within a processor complex. Each of these units fetches and executes instructions belonging to its assigned task. The appearance of a single logical register file is maintained with a copy in each parallel processing unit. Register results are dynamically routed among the many parallel processing units with the help of compiler-generated masks. Memory accesses may occur speculatively without knowledge of preceding loads or stores. Addresses are disambiguated dynamically, many in parallel, and processing waits only for true data dependences.This paper presents the philosophy of the multiscalar paradigm, the structure of multiscalar programs, and the hardware architecture of a multiscalar processor. The paper also discusses performance issues in the multiscalar model, and compares the multiscalar paradigm with other paradigms. Experimental results evaluating the performance of a sample of multiscalar organizations are also presented.
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
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-citationDetection and Parallel Execution of Independent Instructions
Tjaden, G. S., & Flynn, M. J. (1970) · IEEE Transactions on Computers · doi:10.1109/t-c.1970.222795 · Cited by 198
The impact of synchronization and granularity on parallel systems
Chen, D.-K., Su, H.-M., & Yew, P.-C. (1990) · ACM SIGARCH Computer Architecture News · doi:10.1145/325096.325150 · Cited by 64
Cited by
Amdahl's Law in the Multicore Era
Hill, M. D., & Marty, M. R. (2008) · Computer · doi:10.1109/mc.2008.209 · Cited by 1,262
Tullsen, D. M., Eggers, S. J., Emer, J. S., Levy, H. M., Lo, J. L., & Stamm, R. L. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232993 · Cited by 779
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
Memory bandwidth limitations of future microprocessors
Burger, D., Goodman, J. R., & Kägi, A. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232983 · Cited by 392
Scaling to the end of silicon with EDGE architectures
Burger, D., Keckler, S. W., McKinley, K. S., Dahlin, M., John, L. K., Lin, C., Moore, C. R., Burrill, J., McDonald, R. G., & Yoder, W. (2004) · Computer · doi:10.1109/mc.2004.65 · Cited by 354
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
Core fusion: accommodating software diversity in chip multiprocessors
Ipek, E., Kirman, M., Kirman, N., & Martinez, J. F. (2007) · Proceedings of the 34th annual international symposium on Computer architecture · doi:10.1145/1250662.1250686 · Cited by 283
Automatic Thread Extraction with Decoupled Software Pipelining
Ottoni, G., Rangan, R., Stoler, A., & August, D. I. (2006) · 38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'05) · doi:10.1109/micro.2005.13 · Cited by 273
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-citationGopal, 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-citation
Metadata
- Authors
- Sohi, G. S., Breach, S. E., & Vijaykumar, T. N.
- Venue
- Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 414-425
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W2296006986
- Cited by
- 971
- References
- 3
- FWCI
- 20.76
- 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.