A Multi-Pattern Scheduling Algorithm

Y. Guo, C. Hoede

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

1 Citation (Scopus)
43 Downloads (Pure)

Abstract

In a coarse-grained reconfigurable architecture, the function of resources such as Arithmetic Logic Units (ALU) can be reconfigured at run-time. The traditional scheduling algorithms always assume a fixed resource pattern. In this paper, we propose an efficient scheduling algorithm assuming that different resource patterns are given. The multi-pattern scheduling algorithm is based on the list scheduling algorithm. The complexity of the proposed algorithm is linear in the number of given patterns.
Original languageUndefined
Title of host publicationProceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05)
EditorsT.P. Plaks, R. DeMara, M. Gokhale, S. Guccione, M. Platzner, Gerardus Johannes Maria Smit, M. Wirthlin
Place of PublicationUSA
PublisherCSREA Press
Pages276-279
Number of pages4
ISBN (Print)1-932415-74-2
Publication statusPublished - Jun 2005
Event2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05 - Las Vegas, Nevada, USA, Las Vegas, United States
Duration: 27 Jun 200530 Jun 2005

Publication series

Name
PublisherCSREA Press

Conference

Conference2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05
Abbreviated titleERSA
CountryUnited States
CityLas Vegas
Period27/06/0530/06/05
Other27-30 Jun 2005

Keywords

  • CAES-EEA: Efficient Embedded Architectures
  • IR-66369
  • METIS-248127
  • EWI-6955

Cite this