Register allocation via graph coloring
Register allocation via graph coloring
Improvements to graph coloring register allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems
MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
New methods to color the vertices of a graph
Communications of the ACM
Register allocation for irregular architectures
Proceedings of the joint conference on Languages, compilers and tools for embedded systems: software and compilers for embedded systems
Register allocation & spilling via graph coloring
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
MiBench: A free, commercially representative embedded benchmark suite
WWC '01 Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop
Solving the Register Allocation Problem for Embedded Systems Using a Hybrid Evolutionary Algorithm
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Memory or registers are used to store the results of computation of a program. As compared to memory, accessing a register is much faster, but they are scarce resources, in real-time embedded systems and have to be utilized very efficiently. If the register set is not sufficient to hold all program variables, certain values have to be stored in memory and so-called spill code has to be inserted. The optimization goal is to hold as many live variables as possible in registers in order to avoid expensive memory accesses. The register allocation phase is generally more challenging in embedded systems In this paper, we present a new hybrid evolutionary algorithm (HEA) for graph coloring register allocation problem for embedded systems based on a new crossover operator called crossover by conflict-free sets (CCS) and a new local search function. The objective is to minimize the total spill cost.