DocumentCode
2830077
Title
Scheduling parallel program tasks on multiprocessors
Author
Kawaguchi, Tsuyoshi ; Masuyama, Hiroshi
Author_Institution
Dept. of Electron. Eng., Miyazaki Univ., Japan
fYear
1991
fDate
11-14 Jun 1991
Firstpage
1037
Abstract
The authors study the problem of scheduling precedence-related tasks on a sufficiently large number of processors to minimize the total execution time. Without communication delay between processors, this problem can be solved by using the critical path method. The authors consider the case when communication delay cannot be disregarded. An algorithm with time complexity O((1.52)n×n log n ) which finds an optimal schedule for a set of n tasks with tree-like precedence relations is presented
Keywords
computational complexity; parallel programming; programming theory; scheduling; communication delay; critical path method; multiprocessors; optimal schedule; parallel program tasks; scheduling precedence-related tasks; time complexity; total execution time; tree-like precedence relations; Assembly; Delay effects; Finishing; Grain size; Multiprocessing systems; Optimal scheduling; Partitioning algorithms; Processor scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176542
Filename
176542
Link To Document