loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth Great Lakes Symposium on VLSI
A Genetic Algorithm for Register Allocation
Ann Arbor, Michigan
March 04-March 06
ISBN: 0-7695-0104-4
ASCII Text
x 
 
K.M. Elleithy, E.G. Abd-El-Fattah, "A Genetic Algorithm for Register Allocation," Great Lakes Symposium on VLSI, pp. 226, Ninth Great Lakes Symposium on VLSI, 1999.
 
 
BibTex
x
 
@article{ 10.1109/GLSV.1999.757416,
author = {K.M. Elleithy and E.G. Abd-El-Fattah},
title = {A Genetic Algorithm for Register Allocation},
journal ={Great Lakes Symposium on VLSI},
volume = {0},
year = {1999},
issn = {1066-1395},
pages = {226},
doi = {http://doi.ieeecomputersociety.org/10.1109/GLSV.1999.757416},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Great Lakes Symposium on VLSI
TI - A Genetic Algorithm for Register Allocation
SN - 1066-1395
SP
EP
A1 - K.M. Elleithy,
A1 - E.G. Abd-El-Fattah,
PY - 1999
VL - 0
JA - Great Lakes Symposium on VLSI
ER -
 
K.M. Elleithy, King Fahd University of Petroleum and Minerals
E.G. Abd-El-Fattah, Moshamit Behera Company
In this paper we introduce a new genetic algorithm for register allocation. A merge operator is used to generate new individual solutions. The number of steps required to examine all pairs in the population matrix to generate n2 (n is the population matrix size). Generating an offspring from the parents needs m steps (m number of nodes). The total number of steps required by the algorithm is n2 m , that is, the genetic algorithm has a linear time complexity in terms of number of nodes. The experimental results show optimal solutions in many of the graphs used for testing.
Citation:
K.M. Elleithy, E.G. Abd-El-Fattah, "A Genetic Algorithm for Register Allocation," glsvlsi, pp.226, Ninth Great Lakes Symposium on VLSI, 1999
Usage of this product signifies your acceptance of the Terms of Use.