The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Linear scan register allocation
Open accessAbstract
We describe a new algorithm for fast global register allocation called linear scan . This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, “just-in-time” compilers, and interactive development environments.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,082
Advanced Compiler Design and Implementation
Muchnick, S. S. (1997) · Cited by 2,312
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
Register allocation via coloring
Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hopkins, M. E., & Markstein, P. W. (1981) · Computer Languages · doi:10.1016/0096-0551(81)90048-5 · Cited by 737
Improvements to graph coloring register allocation
Briggs, P., Cooper, K. D., & Torczon, L. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177575 · Cited by 388
A retargetable C compiler : design and implementation
Fraser, C. W., & Hanson, D. R. (1995) · Cited by 321
Register allocation via usage counts
Freiburghouse, R. A. (1974) · Communications of the ACM · doi:10.1145/361179.361201 · Cited by 69
Combining Register Allocation and Instruction Scheduling
Motwani, R., Palem, K. V., Sarkar, V., & Reyen, S. (1995) · Cited by 49
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
Metadata
- Authors
- Poletto, M., & Sarkar, V.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1999-09
- Volume
- 21
- Issue
- 5
- Pages
- 895-913
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2140191557
- Cited by
- 357
- References
- 9
- FWCI
- 13.43
- 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: Linear scan register allocation. https://app.cochat.ai/papers/10.1145/330249.330250
- The paper
- Poletto, M., & Sarkar, V. (1999). Linear scan register allocation. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/330249.330250
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.
