Publication:
A hybrid evolutionary algorithm for solving the register allocation problem

dc.contributor.authorsDemiroz, B; Topcuoglu, H; Kandemir, M
dc.contributor.editorGottlieb, J
dc.contributor.editorRaidl, GR
dc.date.accessioned2022-03-12T15:58:55Z
dc.date.accessioned2026-01-11T06:01:41Z
dc.date.available2022-03-12T15:58:55Z
dc.date.issued2004
dc.description.abstractOne of the strong impacts on runtime performance of a given code is the register allocation phase of compilation. It is crucial to provide aggressive and sophisticated register allocators for the embedded devices, where the excessive compilation time is tolerated because of its off-line nature. In this paper, we present a hybrid evolutionary algorithm for register allocation problem that combines genetic algorithms with a local search technique. Our algorithm exploits a novel, highly-specialized crossover operator that considers domain-specific information. Computational experiments performed on various synthetic benchmarks prove that our method significantly outperform the state-of-the-art, algorithms with respect to all given comparison metrics on solution quality.
dc.identifier.doidoiWOS:000189502600007
dc.identifier.eissn1611-3349
dc.identifier.isbn3-540-21367-8
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/11424/224218
dc.identifier.wosWOS:000189502600007
dc.language.isoeng
dc.publisherSPRINGER-VERLAG BERLIN
dc.relation.ispartofEVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectGRAPH
dc.titleA hybrid evolutionary algorithm for solving the register allocation problem
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage71
oaire.citation.startPage62
oaire.citation.titleEVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS
oaire.citation.volume3004

Files