NDLI: Coloring-based coalescing for graph coloring register allocation

Please wait, while we are loading the content...

PinPlay: a framework for deterministic replay and reproducible analysis of parallel programs

Taming hardware event samples for FDO compilation

A self-adjusting code cache manager to balance start-up time and memory usage

Decoupled software pipelining creates parallelization opportunities

Coloring-based coalescing for graph coloring register allocation

Automatic creation of tile size selection models

Towards program optimization through automated analysis of numerical precision

Contention aware execution: online contention detection and response

Performance is dead, long live performance!

TAO: two-level atomicity for dynamic binary optimizations

Lightweight feedback-directed cross-module optimization

On improving heap memory layout by dynamic pool allocation

Prospect: a compiler framework for speculative parallelization

Linear scan register allocation on SSA form

Parameterized tiling revisited

Statistically regulating program behavior via mainstream computing

An adaptive task creation strategy for work-stealing scheduling

There are at least two sides to every heterogeneous system

Umbra: efficient and scalable memory shadowing

Automated just-in-time compiler tuning

An efficient software transactional memory using commit-time invalidation

Speculative parallelization of partial reduction variables

Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bit instructions

Minimizing communication in rate-optimal software pipelining for stream programs

Exploiting statistical correlations for proactive prediction of program behaviors

Dynamic interpretation for dynamic scripting languages

Large program trace analysis and compression with ZDDs

Hybrid Java compilation and optimization for digital TV software platform

Efficient compilation of fine-grained SPMD-threaded programs for multicore CPUs

Automatic parallelization of simulink applications

Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code

Coloring-based coalescing for graph coloring register allocation

Content Provider	ACM Digital Library
Author	Odaira, Rei Nakaike, Takuya Inagaki, Tatsushi Nakatani, Toshio Komatsu, Hideaki
Abstract	Graph coloring register allocation tries to minimize the total cost of spilled live ranges of variables. Live-range splitting and coalescing are often performed before the coloring to further reduce the total cost. Coalescing of split live ranges, called sub-ranges, can decrease the total cost by lowering the interference degrees of their common interference neighbors. However, it can also increase the total cost because the coalesced sub-ranges can become uncolorable. In this paper, we propose coloring-based coalescing, which first performs trial coloring and next coalesces all copyrelated sub-ranges that were assigned the same color. The coalesced graph is then colored again with the graph coloring register allocation. The rationale is that coalescing of differently colored sub-ranges could result in spilling because there are some interference neighbors that prevent them from being assigned the same color. Experiments on Java programs show that the combination of live-range splitting and coloring-based coalescing reduces the static spill cost by more than 6% on average, comparing to the baseline coloring without splitting. In contrast, well-known iterated and optimistic coalescing algorithms, when combined with splitting, increase the cost by more than 20%. Coloring-based coalescing improves the execution time by up to 15% and 3% on average, while the existing algorithms improve by up to 12% and 1% on average.
Starting Page	160
Ending Page	169
Page Count	10
File Format	PDF
ISBN	9781605586359
DOI	10.1145/1772954.1772978
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-04-24
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Register coalescing Register allocation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Preference-directed graph coloring

Coloring-based coalescing for graph coloring register allocation (2010)

Using node merging to enhance graph coloring

Advanced conservative and optimistic register coalescing

Graph-coloring and treescan register allocation using repairing

Formal Verification of Coalescing Graph-Coloring Register Allocation

Copy coalescing by graph recoloring

Optimistic register coalescing

Iterated Register Coalescing (1996)

Coloring-based coalescing for graph coloring register allocation

Similar Documents

Preference-directed graph coloring

Coloring-based coalescing for graph coloring register allocation (2010)

Using node merging to enhance graph coloring

Advanced conservative and optimistic register coalescing

Graph-coloring and treescan register allocation using repairing

Formal Verification of Coalescing Graph-Coloring Register Allocation

Copy coalescing by graph recoloring

Optimistic register coalescing

Iterated Register Coalescing (1996)

Coloring-based coalescing for graph coloring register allocation