The DOI matches its Crossref record.
Register allocation by priority-based coloring
Abstract
The classic problem of global register allocation is treated in a heuristic and practical manner by adopting the notion of priorities in node-coloring. The assignment of priorities is based on estimates of the benefits that can be derived from allocating individual quantities in registers. Using the priorities, the exponential coloring process can be made to run in linear time. Since the costs involved in register allocation are taken into account, the algorithm does not over-allocate. The algorithm can be parameterized to cater to different fetch characteristics and register configurations among machines. Measurements indicate that the register allocation scheme is effective on a number of target machines. The results confirm that, using priority-based coloring, global register allocation can be performed practically and efficiently.
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
Cited by
A Column Generation Approach for Graph Coloring
Mehrotra, A., & Trick, M. A. (1996) · INFORMS Journal on Computing · doi:10.1287/ijoc.8.4.344 · Cited by 410
An accurate worst case timing analysis for RISC processors
Lim, S.-S., Bae, Y. H., Jang, G. T., Rhee, B.-D., Min, S. L., Park, C. Y., Shin, H., Park, K., Moon, S.-M., & Kim, C. S. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.392980 · Cited by 254
Improving the ratio of memory operations to floating-point operations in loops
Carr, S., & Kennedy, K. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/197320.197366 · Cited by 155
Metadata
- Authors
- Chow, F., & Hennessy, J.
- Venue
- Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84
- Publisher
- ACM Press
- Published
- 1984
- Pages
- 222-232
- OpenAlex
- W1969000084
- Cited by
- 220
- References
- 0
- FWCI
- 2.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Register allocation by priority-based coloring. https://app.cochat.ai/papers/10.1145/502874.502896
- The paper
- Chow, F., & Hennessy, J. (1984). Register allocation by priority-based coloring. Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84. https://doi.org/10.1145/502874.502896
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.