A Pattern Selection Algorithm for Multi-Pattern Scheduling

Y. Guo; C. Hoede; Gerardus Johannes Maria Smit

doi:10.1109/IPDPS.2006.1639452

A Pattern Selection Algorithm for Multi-Pattern Scheduling

Y. Guo, C. Hoede, Gerardus Johannes Maria Smit

Discrete Mathematics and Mathematical Programming

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

41 Downloads (Pure)

Abstract

The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.

Original language	English
Title of host publication	Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)
Place of Publication	Los Alamitos, CA, USA
Publisher	IEEE
Pages	198-205
Number of pages	8
ISBN (Print)	1-4244-0054-6
DOIs	https://doi.org/10.1109/IPDPS.2006.1639452
Publication status	Published - Apr 2006
Event	13th Reconfigurable Architectures Workshop, RAW 2006 - Rhodes Island, Greece Duration: 25 Apr 2006 → 26 Apr 2006 Conference number: 13 http://www.ece.lsu.edu/vaidy/raw06/

Publication series

Name
Publisher	IEEE Computer Society
Number	2

Workshop

Workshop	13th Reconfigurable Architectures Workshop, RAW 2006
Abbreviated title	RAW
Country/Territory	Greece
City	Rhodes Island
Period	25/04/06 → 26/04/06
Internet address	http://www.ece.lsu.edu/vaidy/raw06/

Keywords

CAES-EEA: Efficient Embedded Architectures
METIS-238181
EWI-6957
IR-66371

Access to Document

10.1109/IPDPS.2006.1639452

01639452

Cite this

@inproceedings{848ce6cf43b04bb1b4f90c3f9aef71bd,

title = "A Pattern Selection Algorithm for Multi-Pattern Scheduling",

abstract = "The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.",

keywords = "CAES-EEA: Efficient Embedded Architectures, METIS-238181, EWI-6957, IR-66371",

author = "Y. Guo and C. Hoede and Smit, {Gerardus Johannes Maria}",

note = "10.1109/IPDPS.2006.1639452 ; 13th Reconfigurable Architectures Workshop, RAW 2006, RAW ; Conference date: 25-04-2006 Through 26-04-2006",

year = "2006",

month = apr,

doi = "10.1109/IPDPS.2006.1639452",

language = "English",

isbn = "1-4244-0054-6",

publisher = "IEEE",

number = "2",

pages = "198--205",

booktitle = "Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)",

address = "United States",

url = "http://www.ece.lsu.edu/vaidy/raw06/",

}

Guo, Y, Hoede, C & Smit, GJM 2006, A Pattern Selection Algorithm for Multi-Pattern Scheduling. in Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)., 10.1109/IPDPS.2006.1639452, IEEE, Los Alamitos, CA, USA, pp. 198-205, 13th Reconfigurable Architectures Workshop, RAW 2006, Rhodes Island, Greece, 25/04/06. https://doi.org/10.1109/IPDPS.2006.1639452

A Pattern Selection Algorithm for Multi-Pattern Scheduling. / Guo, Y.; Hoede, C.; Smit, Gerardus Johannes Maria.
Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05). Los Alamitos, CA, USA: IEEE, 2006. p. 198-205 10.1109/IPDPS.2006.1639452.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A Pattern Selection Algorithm for Multi-Pattern Scheduling

AU - Guo, Y.

AU - Hoede, C.

AU - Smit, Gerardus Johannes Maria

N1 - Conference code: 13

PY - 2006/4

Y1 - 2006/4

N2 - The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.

AB - The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns. This paper presents a method to select a near-optimal set of patterns. By using these patterns, the multi-pattern scheduling will result in a better schedule in the sense that the schedule will have fewer clock cycles.

KW - CAES-EEA: Efficient Embedded Architectures

KW - METIS-238181

KW - EWI-6957

KW - IR-66371

U2 - 10.1109/IPDPS.2006.1639452

DO - 10.1109/IPDPS.2006.1639452

M3 - Conference contribution

SN - 1-4244-0054-6

SP - 198

EP - 205

BT - Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05)

PB - IEEE

CY - Los Alamitos, CA, USA

T2 - 13th Reconfigurable Architectures Workshop, RAW 2006

Y2 - 25 April 2006 through 26 April 2006

ER -