Live briefing
Everything about Register allocation
Computer compiler optimization technique
In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Register allocationA 5-minute orientation
- Skim a recent paper: The influence of individual and municipality characteristics on allocation of long-term care services: a register-based cross-sectional studyInfluential work since 2022
- Pick up a classic book: An Introduction to ASM86The most-reprinted book on the subject
- Read the landmark paper: Register allocation via coloringCited 435 times
- Go sideways: Chaitin's algorithmA closely related topic
- Go sideways: Graph coloringA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Register allocation via coloring
Improvements to graph coloring register allocation
Linear scan register allocation
Complete Register Allocation Problems
Register allocation by priority-based coloring
Register allocation via usage counts
Index Register Allocation
Fusion-based register allocation
🆕 Influential since 2022
The influence of individual and municipality characteristics on allocation of long-term care services: a register-based cross-sectional study
Secure Register Allocation for Trusted Code Generation
Allocation of Adult Day Care Services to Different User Groups: A Register-Based Cross-Sectional Study
Energy-Aware Register Allocation for VLIW Processors
BitEA: BitVertex Evolutionary Algorithm to Enhance Performance for Register Allocation
📚 Books worth reading
- 📕An Introduction to ASM86Intel · 1981
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Chaitin's algorithm Chaitin's algorithm is a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric. It is named after its designer…
- Graph coloring In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain…
- Greedy coloring In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of…
- Interval graph In graph theory, an interval graph is an undirected graph formed from a set of intervals on the real line, with a vertex for each interval and an edge…
- Vertex cover In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.…
- Treewidth In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest…
- Gregory Chaitin Gregory John Chaitin (/ˈtʃaɪtɪn/ CHY-tin; born 25 June 1947) is an Argentine-American mathematician and computer scientist. His work was foundational to…
- Independent set (graph theory) In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a…