The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Automatic Thread Extraction with Decoupled Software Pipelining
Abstract
Until recently, a steadily rising clock rate and other uniprocessor micro architectural improvements could be relied upon to consistently deliver increasing performance for a wide range of applications. Current difficulties in maintaining this trend have lead microprocessor manufacturers to add value by incorporating multiple processors on a chip. Unfortunately, since decades of compiler research have not succeeded in delivering automatic threading for prevalent code properties, this approach demonstrates no improvement for a large class of existing codes. To find useful work for chip multiprocessors, we propose an automatic approach to thread extraction, called decoupled software pipelining (DSWP). DSWP exploits the finegrained pipeline parallelism lurking in most applications to extract long-running, concurrently executing threads. Use of the nonspeculative and truly decoupled threads produced by DSWP can increase execution efficiency and provide significant latency tolerance, mitigating design complexity by reducing intercore communication and per-core resource requirements. Using our initial fully automatic compiler implementation and a validated processor model, we prove the concept by demonstrating significant gains for dual-core chip multiprocessor models running a variety of codes. We then explore simple opportunities missed by our initial compiler implementation which suggest a promising future for this approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Optimizing Compilers for Modern Architectures: A Dependence-based Approach
Kennedy, K., & Allen, J. R. (2001) · Cited by 1,002
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
Software pipelining: an effective scheduling technique for VLIW machines
Lam, M. S. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989420 · Cited by 884
Software pipelining: an effective scheduling technique for VLIW machines
Lam, M. (1988) · Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation · doi:10.1145/53990.54022 · Cited by 641
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
A stream compiler for communication-exposed architectures
Gordon, M. I., Thies, W., Karczmarek, M., Lin, J., Meli, A. S., Lamb, A. A., Leger, C., Wong, J., Hoffmann, H., Maze, D., et al. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605428 · Cited by 337
Decoupled access/execute computer architectures
Smith, J. E. (1982) · ACM SIGARCH Computer Architecture News · doi:10.1145/1067649.801719 · Cited by 272
The superthreaded processor architecture
Tsai, J.-Y., Huang, J., Amlo, C., Lilja, D. J., & Yew, P.-C. (1999) · IEEE Transactions on Computers · doi:10.1109/12.795219 · Cited by 183
Cited by
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Gordon, M. I., Thies, W., & Amarasinghe, S. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168877 · Cited by 512
A catalog of stream processing optimizations
Hirzel, M., Soulé, R., Schneider, S., Gedik, B., & Grimm, R. (2014) · ACM Computing Surveys · doi:10.1145/2528412 · Cited by 299
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
Thies, W., Chandrasekhar, V., & Amarasinghe, S. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.38 · Cited by 274
Metadata
- Authors
- Ottoni, G., Rangan, R., Stoler, A., & August, D. I.
- Venue
- 38th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'05)
- Publisher
- IEEE
- Published
- 2006-10-11
- Pages
- 105-118
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2171546589
- Cited by
- 273
- References
- 13
- FWCI
- 16.40
- 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.