Instruction-set architecture exploration of VLIW aSIPs using a genetic algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

14 Citations (Scopus)

Abstract

Genetic algorithms are commonly used for automatically solving complex design problem because exploration using genetic algorithms can consistently deliver good results when the algorithm is given a long enough run-time. However, the exploration time for problems with huge design spaces can be very long, often making exploration using a genetic algorithm practically infeasible. In this work, we present a genetic algorithm for exploring the instruction-set architecture of VLIW ASIPs and demonstrate its effectiveness by comparing it to two heuristic algorithms. We present several optimizations to the genetic algorithm configuration, and demonstrate how caching of intermediate compilation and simulation results can reduce the exploration time by an order of magnitude.
Original languageEnglish
Title of host publicationProceedings on the 3rd Mediterranean Conference on Embedded Computing (MECO), 15-19 June 2014, Budva, Montenegro
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages32-35
ISBN (Print)978-1-4799-4827-7
DOIs
Publication statusPublished - 2014
Event3rd Mediterranean Conference on Embedded Computing, MECO 2014 - Budva, Montenegro
Duration: 15 Jun 201419 Jun 2014
Conference number: 3

Conference

Conference3rd Mediterranean Conference on Embedded Computing, MECO 2014
Abbreviated titleMECO 2014
Country/TerritoryMontenegro
CityBudva
Period15/06/1419/06/14

Fingerprint

Dive into the research topics of 'Instruction-set architecture exploration of VLIW aSIPs using a genetic algorithm'. Together they form a unique fingerprint.

Cite this