The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Postpass Code Optimization of Pipeline Constraints
Open accessAbstract
Pipeline interlocks are used in a pipelined architecture to prevent the execution of a machine instruction before its operands are available.An alternative to this complex piece of hardware is to rearrange the instructions at compile time to avoid pipeline interlocks.This problem is called code reorganization and is studied here.The basic problem of reorganization of machine-level instructions at compile time is shown to be NP-complete.A heuristic algorithm is proposed, and its properties and effectiveness are explored.Empirical data from MIPS, a VLSI processor design, are given.The impact of code reorganization techniques on the rest of a compiler system is discussed.
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
NP-complete scheduling problems
Ullman, J. D. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80008-0 · Cited by 1,452
Trace Scheduling: A Technique for Global Microcode Compaction
Fisher (1981) · IEEE Transactions on Computers · doi:10.1109/tc.1981.1675827 · Cited by 1,267
Computer and job-shop scheduling theory
Coffman, E. G., & Bruno, J. L. (1976) · Medical Entomology and Zoology · Cited by 1,107
Aho, A. V., & Ullman, J. D. (1977) · International Linear Collider · Cited by 1,003
The Architecture of Pipelined Computers
Kogge, P. M. (1981) · Medical Entomology and Zoology · Cited by 536
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Aho, A. V., & Ullman, J. D. (1977) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 368
The case for the reduced instruction set computer
Patterson, D. A., & Ditzel, D. R. (1980) · ACM SIGARCH Computer Architecture News · doi:10.1145/641914.641917 · Cited by 211
RISC I: a reduced instruction set VLSI computer
Patterson, D. A., & Sequin, C. H. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.285981 · Cited by 181
Symbolic Debugging of Optimized Code
Hennessy, J. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357173 · Cited by 169
Self-citation
Cited by
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594
Estimating interlock and improving balance for pipelined architectures
Callahan, D., Cocke, J., & Kennedy, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90002-0 · Cited by 152
Metadata
- Authors
- Hennessy, J. L., & Gross, T.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1983-07
- Volume
- 5
- Issue
- 3
- Pages
- 422-448
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2048936605
- Cited by
- 271
- References
- 11
- FWCI
- 9.60
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Postpass Code Optimization of Pipeline Constraints. https://app.cochat.ai/papers/10.1145/2166.357217
- The paper
- Hennessy, J. L., & Gross, T. (1983). Postpass Code Optimization of Pipeline Constraints. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/2166.357217
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.