Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart

S.M. Heemstra de Groot; O.E. Herrmann

doi:10.1109/EMWRT.1990.128220

Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart

S.M. Heemstra de Groot, O.E. Herrmann

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

2 Citations (Scopus)

54 Downloads (Pure)

Abstract

An algorithm based on an alternative scheduling approach for iterative acyclic and cyclid DFGs (data-flow graphs) with limited resources that exploits inter- and intra-iteration parallelism is presented. The method is based on guiding the scheduling algorithm with the information supplied by a scheduling-range chart. This scheduling range is relative to a reference operation and can be finite or infinite. The information in the scheduling-range chart is used during scheduling in order to optimize the sampling period. For cases where the precedence constraints do not allow a schedule in the originally selected optimal sampling period, the algorithm provides an adjustment procedure, thus always guaranteeing a solution. The delay of the processor-assignment phase increases the efficiency of the algorithm when the operations have processing times different from the unity and are nonpreemptive

Original language	English
Title of host publication	Euromicro'90 Workshop on Real-Time Systems
Publisher	IEEE
Pages	8-16
Number of pages	9
ISBN (Print)	9780818620768
DOIs	https://doi.org/10.1109/EMWRT.1990.128220
Publication status	Published - 1 Sep 1990
Event	2nd Euromicro Workshop on Real-Time Systems 1990 - Hørsholm, Denmark Duration: 6 Jun 1990 → 8 Jun 1990 Conference number: 2

Conference

Conference	2nd Euromicro Workshop on Real-Time Systems 1990
Country	Denmark
City	Hørsholm
Period	6/06/90 → 8/06/90

Keywords

METIS-113085
IR-16200

Access to Document

10.1109/EMWRT.1990.128220

00128220
open

Fingerprint Dive into the research topics of 'Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart'. Together they form a unique fingerprint.

Cite this

@inproceedings{b4dd95db4d274616b2cfe9c2d8477cb6,

title = "Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart",

abstract = "An algorithm based on an alternative scheduling approach for iterative acyclic and cyclid DFGs (data-flow graphs) with limited resources that exploits inter- and intra-iteration parallelism is presented. The method is based on guiding the scheduling algorithm with the information supplied by a scheduling-range chart. This scheduling range is relative to a reference operation and can be finite or infinite. The information in the scheduling-range chart is used during scheduling in order to optimize the sampling period. For cases where the precedence constraints do not allow a schedule in the originally selected optimal sampling period, the algorithm provides an adjustment procedure, thus always guaranteeing a solution. The delay of the processor-assignment phase increases the efficiency of the algorithm when the operations have processing times different from the unity and are nonpreemptive",

keywords = "METIS-113085, IR-16200",

author = "{Heemstra de Groot}, S.M. and O.E. Herrmann",

year = "1990",

month = sep,

day = "1",

doi = "10.1109/EMWRT.1990.128220",

language = "English",

isbn = "9780818620768",

pages = "8--16",

booktitle = "Euromicro'90 Workshop on Real-Time Systems",

publisher = "IEEE",

address = "United States",

note = "2nd Euromicro Workshop on Real-Time Systems 1990 ; Conference date: 06-06-1990 Through 08-06-1990",

}

TY - GEN

T1 - Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart

AU - Heemstra de Groot, S.M.

AU - Herrmann, O.E.

N1 - Conference code: 2

PY - 1990/9/1

Y1 - 1990/9/1

N2 - An algorithm based on an alternative scheduling approach for iterative acyclic and cyclid DFGs (data-flow graphs) with limited resources that exploits inter- and intra-iteration parallelism is presented. The method is based on guiding the scheduling algorithm with the information supplied by a scheduling-range chart. This scheduling range is relative to a reference operation and can be finite or infinite. The information in the scheduling-range chart is used during scheduling in order to optimize the sampling period. For cases where the precedence constraints do not allow a schedule in the originally selected optimal sampling period, the algorithm provides an adjustment procedure, thus always guaranteeing a solution. The delay of the processor-assignment phase increases the efficiency of the algorithm when the operations have processing times different from the unity and are nonpreemptive

AB - An algorithm based on an alternative scheduling approach for iterative acyclic and cyclid DFGs (data-flow graphs) with limited resources that exploits inter- and intra-iteration parallelism is presented. The method is based on guiding the scheduling algorithm with the information supplied by a scheduling-range chart. This scheduling range is relative to a reference operation and can be finite or infinite. The information in the scheduling-range chart is used during scheduling in order to optimize the sampling period. For cases where the precedence constraints do not allow a schedule in the originally selected optimal sampling period, the algorithm provides an adjustment procedure, thus always guaranteeing a solution. The delay of the processor-assignment phase increases the efficiency of the algorithm when the operations have processing times different from the unity and are nonpreemptive

KW - METIS-113085

KW - IR-16200

U2 - 10.1109/EMWRT.1990.128220

DO - 10.1109/EMWRT.1990.128220

M3 - Conference contribution

SN - 9780818620768

SP - 8

EP - 16

BT - Euromicro'90 Workshop on Real-Time Systems

PB - IEEE

T2 - 2nd Euromicro Workshop on Real-Time Systems 1990

Y2 - 6 June 1990 through 8 June 1990

ER -