Hybrid Evolutionary Algorithm for the Graph Coloring Register Allocation Problem for Embedded Systems

  • Authors:
  • Anjali Mahajan;M. S. Ali

  • Affiliations:
  • G H Raisoni College of Engineering, Nagpur, India;Prof. Ram Meghe Institute of Technology and Research, Badnera, Amravati, India

  • Venue:
  • Transactions on Computational Science V
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.