A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Details
Original language | English |
---|---|
Title of host publication | 2007 IEEE International Symposium on Circuits and Systems |
Pages | 161-164 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2007 |
Publication type | A4 Article in a conference publication |
Event | 2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 - New Orleans, LA, United States Duration: 27 May 2007 → 30 May 2007 |
Conference
Conference | 2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 |
---|---|
Country | United States |
City | New Orleans, LA |
Period | 27/05/07 → 30/05/07 |
Abstract
In this paper, a genetic algorithm (GA) for scheduling tasks onto dynamically reconfigurable devices is presented. The scheduling problem is NP-hard and more complicated than multiprocessor scheduling, because both the task allocation and the configurations need to be carefully managed. The approach has been validated with a number of random task graphs. The results show that the GA approach has good convergence and it is in average 8.6% better than a list-based scheduler for large task graphs of various sizes.