Tampere University of Technology

TUTCRIS Research Portal

A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware

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

Details

Original languageEnglish
Title of host publication2007 IEEE International Symposium on Circuits and Systems
Pages161-164
Number of pages4
DOIs
Publication statusPublished - 2007
Publication typeA4 Article in a conference publication
Event2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 - New Orleans, LA, United States
Duration: 27 May 200730 May 2007

Conference

Conference2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007
CountryUnited States
CityNew Orleans, LA
Period27/05/0730/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.