Optimal vs. Heuristic Integrated Code Generation for Clustered VLIW Architectures.
2008 (English)In: 11th ACM SIGBED Int. Workshop on Software and Compilers for Embedded Systems SCOPES 2008,2008, New York, USA: Association for Computing Machinery (ACM), 2008, 11-20 p.Conference paper (Refereed)
In this paper we present two algorithms for integrated code generation for clustered VLIW architectures. One algorithm is a heuristic based on genetic algorithms, the other algorithm is based on integer linear programming. The performance of the algorithms are compared on a portion of the Mediabench benchmark suite. We found the results of the genetic algorithm to be within one or two clock cycles from optimal for the cases where the optimum is known. In addition the heuristic algorithm produces results in predictable time also when the optimal integer linear program fails.
Place, publisher, year, edition, pages
New York, USA: Association for Computing Machinery (ACM), 2008. 11-20 p.
compiler technology, integrated code generation, genetic programming, integer linear programming
IdentifiersURN: urn:nbn:se:liu:diva-43690DOI: 10.1145/1361096.1361099Local ID: 74553OAI: oai:DiVA.org:liu-43690DiVA: diva2:264550
11th international workshop on Software & compilers for embedded systems, Munich, Germany, 13-14 March 2008