A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware

Yang Qu, Juha-Pekka Soininen, Jari Nurmi

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

9 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings
Subtitle of host publicationIEEE International Symposium on Circuits and Systems, ISCAS 2007
Pages161-164
DOIs
Publication statusPublished - 2007
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Circuits and Systems, ISCAS 2007 - New Orleans, LA, United States
Duration: 27 May 200730 May 2007

Conference

ConferenceIEEE International Symposium on Circuits and Systems, ISCAS 2007
Abbreviated titleISCAS 2007
CountryUnited States
CityNew Orleans, LA
Period27/05/0730/05/07

Fingerprint

Reconfigurable hardware
Genetic algorithms
Scheduling
Computational complexity

Keywords

  • run-time reconfigurable hardware, genetic algorithm
  • task scheduling

Cite this

Qu, Y., Soininen, J-P., & Nurmi, J. (2007). A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. In Proceedings: IEEE International Symposium on Circuits and Systems, ISCAS 2007 (pp. 161-164) https://doi.org/10.1109/ISCAS.2007.378246
Qu, Yang ; Soininen, Juha-Pekka ; Nurmi, Jari. / A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. Proceedings: IEEE International Symposium on Circuits and Systems, ISCAS 2007. 2007. pp. 161-164
@inproceedings{513a50ae790f4f0ba7f644bb3e99d29a,
title = "A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware",
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.",
keywords = "run-time reconfigurable hardware, genetic algorithm, task scheduling",
author = "Yang Qu and Juha-Pekka Soininen and Jari Nurmi",
year = "2007",
doi = "10.1109/ISCAS.2007.378246",
language = "English",
isbn = "1-4244-0920-9",
pages = "161--164",
booktitle = "Proceedings",

}

Qu, Y, Soininen, J-P & Nurmi, J 2007, A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. in Proceedings: IEEE International Symposium on Circuits and Systems, ISCAS 2007. pp. 161-164, IEEE International Symposium on Circuits and Systems, ISCAS 2007, New Orleans, LA, United States, 27/05/07. https://doi.org/10.1109/ISCAS.2007.378246

A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. / Qu, Yang; Soininen, Juha-Pekka; Nurmi, Jari.

Proceedings: IEEE International Symposium on Circuits and Systems, ISCAS 2007. 2007. p. 161-164.

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

TY - GEN

T1 - A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware

AU - Qu, Yang

AU - Soininen, Juha-Pekka

AU - Nurmi, Jari

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - run-time reconfigurable hardware, genetic algorithm

KW - task scheduling

U2 - 10.1109/ISCAS.2007.378246

DO - 10.1109/ISCAS.2007.378246

M3 - Conference article in proceedings

SN - 1-4244-0920-9

SN - 1-4244-0921-7

SP - 161

EP - 164

BT - Proceedings

ER -

Qu Y, Soininen J-P, Nurmi J. A genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. In Proceedings: IEEE International Symposium on Circuits and Systems, ISCAS 2007. 2007. p. 161-164 https://doi.org/10.1109/ISCAS.2007.378246