A Multi-Pattern Scheduling Algorithm

Y. Guo; C. Hoede

A Multi-Pattern Scheduling Algorithm

Y. Guo, C. Hoede

Discrete Mathematics and Mathematical Programming

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

1 Citation (Scopus)

91 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 language	Undefined
Title of host publication	Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05)
Editors	T.P. Plaks, R. DeMara, M. Gokhale, S. Guccione, M. Platzner, Gerardus Johannes Maria Smit, M. Wirthlin
Place of Publication	USA
Publisher	CSREA Press
Pages	276-279
Number of pages	4
ISBN (Print)	1-932415-74-2
Publication status	Published - Jun 2005
Event	2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05 - Las Vegas, Nevada, USA, Las Vegas, United States Duration: 27 Jun 2005 → 30 Jun 2005

Publication series

Name
Publisher	CSREA Press

Conference

Conference	2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05
Abbreviated title	ERSA
Country/Territory	United States
City	Las Vegas
Period	27/06/05 → 30/06/05
Other	27-30 Jun 2005

Keywords

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

Access to Document

Cite this

@inproceedings{fc7b5715ec9249c6a82ce982433cb98b,

title = "A Multi-Pattern Scheduling Algorithm",

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.",

keywords = "CAES-EEA: Efficient Embedded Architectures, IR-66369, METIS-248127, EWI-6955",

author = "Y. Guo and C. Hoede",

year = "2005",

month = jun,

language = "Undefined",

isbn = "1-932415-74-2",

publisher = "CSREA Press",

pages = "276--279",

editor = "T.P. Plaks and R. DeMara and M. Gokhale and S. Guccione and M. Platzner and Smit, {Gerardus Johannes Maria} and M. Wirthlin",

booktitle = "Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05)",

note = "2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05 ; Conference date: 27-06-2005 Through 30-06-2005",

}

Guo, Y & Hoede, C 2005, A Multi-Pattern Scheduling Algorithm. in TP Plaks, R DeMara, M Gokhale, S Guccione, M Platzner, GJM Smit & M Wirthlin (eds), Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05). CSREA Press, USA, pp. 276-279, 2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05, Las Vegas, Nevada, United States, 27/06/05.

A Multi-Pattern Scheduling Algorithm. / Guo, Y.; Hoede, C.
Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05). ed. / T.P. Plaks; R. DeMara; M. Gokhale; S. Guccione; M. Platzner; Gerardus Johannes Maria Smit; M. Wirthlin. USA: CSREA Press, 2005. p. 276-279.

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

TY - GEN

T1 - A Multi-Pattern Scheduling Algorithm

AU - Guo, Y.

AU - Hoede, C.

PY - 2005/6

Y1 - 2005/6

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

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

KW - CAES-EEA: Efficient Embedded Architectures

KW - IR-66369

KW - METIS-248127

KW - EWI-6955

M3 - Conference contribution

SN - 1-932415-74-2

SP - 276

EP - 279

BT - Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'05)

A2 - Plaks, T.P.

A2 - DeMara, R.

A2 - Gokhale, M.

A2 - Guccione, S.

A2 - Platzner, M.

A2 - Smit, Gerardus Johannes Maria

A2 - Wirthlin, M.

PB - CSREA Press

CY - USA

T2 - 2005 International Conference on Engineering of Reconfigurable Systems & Algorithms, ERSA '05

Y2 - 27 June 2005 through 30 June 2005

ER -