Samenvatting
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.
Originele taal-2 | Engels |
---|---|
Titel | Proceedings on the 3rd Mediterranean Conference on Embedded Computing (MECO), 15-19 June 2014, Budva, Montenegro |
Plaats van productie | Piscataway |
Uitgeverij | Institute of Electrical and Electronics Engineers |
Pagina's | 32-35 |
ISBN van geprinte versie | 978-1-4799-4827-7 |
DOI's | |
Status | Gepubliceerd - 2014 |
Evenement | 3rd Mediterranean Conference on Embedded Computing, MECO 2014 - Budva, Montenegro Duur: 15 jun. 2014 → 19 jun. 2014 Congresnummer: 3 |
Congres
Congres | 3rd Mediterranean Conference on Embedded Computing, MECO 2014 |
---|---|
Verkorte titel | MECO 2014 |
Land/Regio | Montenegro |
Stad | Budva |
Periode | 15/06/14 → 19/06/14 |
Ander | MECO 2014 |