UB ScholarWorks

A Genetic Algorithm For Register Allocation

Show simple item record

dc.contributor.advisor Elleithy, Khaled M. en_US
dc.contributor.author Elleithy, Khaled M. en_US
dc.contributor.author Abd-El-Fattah, E. G. en_US
dc.date.accessioned 2014-07-16T16:54:46Z
dc.date.available 2014-07-16T16:54:46Z
dc.date.issued 1999-03-01 en_US
dc.identifier.other bd0d0475-098a-e456-7a82-382d9965cc4d en_US
dc.identifier.uri https://scholarworks.bridgeport.edu/xmlui/handle/123456789/734
dc.description.abstract 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 n2m, 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. en_US
dc.description.uri http://ieeexplore.ieee.org.libproxy.bridgeport.edu/stamp/stamp.jsp?tp=&arnumber=757416&tag=1 en_US
dc.publisher Association for Computing Machinery en_US
dc.subject Computer engineering en_US
dc.subject Computer science en_US
dc.subject Data structures en_US
dc.subject Engineering en_US
dc.subject Wireless communication en_US
dc.title A Genetic Algorithm For Register Allocation en_US
dc.type Article en_US
dc.notes 11/18/11-Posted link to IEEE en_US
dc.event.location Michigan, USA en_US
dc.event.name 1998 9th Great Lake Symposium on VLSI en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search ScholarWorks


Advanced Search

Browse

My Account