Abstrakti
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.
| Alkuperäiskieli | Englanti |
|---|---|
| Otsikko | 2007 IEEE International Symposium on Circuits and Systems |
| Sivut | 161-164 |
| Sivumäärä | 4 |
| DOI - pysyväislinkit | |
| Tila | Julkaistu - 2007 |
| OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
| Tapahtuma | 2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 - New Orleans, LA, Yhdysvallat Kesto: 27 toukok. 2007 → 30 toukok. 2007 |
Conference
| Conference | 2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 |
|---|---|
| Maa/Alue | Yhdysvallat |
| Kaupunki | New Orleans, LA |
| Ajanjakso | 27/05/07 → 30/05/07 |
!!ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering