Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)

Aizu-Wakamatsu, Fukushima, Japan

Mar. 15, 1995 to Mar. 17, 1995

ISBN: 0-8186-7038-X

pp: 227

B. Benko , Fac. of Tech. Sci., Maribor Univ., Slovenia

M. Ojstersek , Fac. of Tech. Sci., Maribor Univ., Slovenia

V. Zumer , Fac. of Tech. Sci., Maribor Univ., Slovenia

ABSTRACT

The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimised. This scheduling problem is known to be NP-hard, and heuristic algorithms have been proposed to obtain optimal and suboptimal solutions. Duplication scheduling heuristic algorithm solves the max-min problem of parallel processor scheduling by duplicating selected scheduled tasks on some PEs. The max-min problem is caused by the trade-off between maximum parallelism versus minimum communication delay. This paper introduces an extension of the near optimal scheduling heuristic, based on a duplication scheduling heuristic. We have focused our research efforts to three main extensions of the original heuristic.

INDEX TERMS

processor scheduling; heuristic programming; parallel programming; duplication scheduling heuristic algorithm; nonstrict triggering; program graph nodes; multiprocessor scheduling; general task graph; multiprocessor system; NP-hard; heuristic algorithms; suboptimal solutions; optimal solutions; max-min problem; maximum parallelism; minimum communication delay; near optimal scheduling heuristic

CITATION

B. Benko,
M. Ojstersek,
V. Zumer,
"Improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes",

*Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on*, vol. 00, no. , pp. 227, 1995, doi:10.1109/AISPAS.1995.401321CITATIONS