A Task Graph Set for Evaluation of Reconfigurable Hardware Scheduling Algorithms

S. M. Loo, J. D. Winningham

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

1 Scopus citations

Abstract

A task graph set is proposed for the evaluation of reconfigurable environment scheduling algorithms. This makes it possible to evaluate scheduling algorithms under the similar conditions. This paper provides an overview of scheduling in a reconfigurable hardware environment. A method to generate task set is presented. The generated task graph set is then evaluated by three heuristics. These heuristics are based on Random (RA), Simulated Annealing (SA), and Genetic Algorithms (GA). The task graph set is available at http://coen.boisestate.edu/smloo/rsdm/.

Original languageEnglish
Title of host publication19th International Conference on Computers and Their Applications 2004, CATA 2004
EditorsBidyut Gupta
Pages159-163
Number of pages5
ISBN (Electronic)9781618395511
StatePublished - 2004
Event19th International Conference on Computers and Their Applications, CATA 2004 - Seattle, United States
Duration: 18 Mar 200420 Mar 2004

Publication series

Name19th International Conference on Computers and Their Applications 2004, CATA 2004

Conference

Conference19th International Conference on Computers and Their Applications, CATA 2004
Country/TerritoryUnited States
CitySeattle
Period18/03/0420/03/04

Fingerprint

Dive into the research topics of 'A Task Graph Set for Evaluation of Reconfigurable Hardware Scheduling Algorithms'. Together they form a unique fingerprint.

Cite this