Volume 3 Number 6 (Jun. 2008)
Home > Archive > 2008 > Volume 3 Number 6 (Jun. 2008) >
JCP 2008 Vol.3(6): 59-65 ISSN: 1796-203X
doi: 10.4304/jcp.3.6.59-65

Hybrid Evolutionary Algorithm based solution for Register Allocation for Embedded Systems

Anjali Mahajan1, M S Ali2
1G H Raisoni College of Engineering, Nagpur, India
2Prof. Ram Meghe Institute of Technology and Research, Badnera, Amravati, India

Abstract—Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either 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 and have to be utilized very efficiently. The optimization goal is to hold as many live variables as possible in registers in order to avoid expensive memory accesses. We present a hybrid evolutionary algorithm for graph coloring register allocation problem based on a new crossover operator called crossover by conflict-free sets(CCS) and a new local search function.

Index Terms—compilers, compiler optimization, register allocation, hybrid evolutionary algorithm, embedded systems

[PDF]

Cite: Anjali Mahajan, M S Ali, "Hybrid Evolutionary Algorithm based solution for Register Allocation for Embedded Systems," Journal of Computers vol. 3, no. 6, pp. 59-65, 2008.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>