DocumentCode
2840696
Title
NP-completeness of the bulk synchronous task scheduling problem and its approximation algorithm
Author
Fujimoto, Noriyuki ; Hagihara, Kenichi
Author_Institution
Graduate Sch. of Eng. Sci., Osaka Univ., Japan
fYear
2000
fDate
2000
Firstpage
127
Lastpage
132
Abstract
The bulk synchronous task scheduling problem (BSSP) is known as an effective task scheduling problem for distributed-memory machines, but the time complexity of BSSP is unknown. This paper presents a proof of NP-completeness of BSSP even in the case of unit time tasks and positive integer constant communication delays. This paper also gives an approximation algorithm for BSSP in several restricted cases
Keywords
computational complexity; delays; distributed memory systems; processor scheduling; NP-completeness; approximation algorithm; bulk synchronous task scheduling problem; distributed-memory machines; positive integer constant communication delays; time complexity; unit time tasks; Approximation algorithms; Concurrent computing; Coprocessors; Delay effects; Packaging machines; Parallel machines; Processor scheduling; Scheduling algorithm; Software packages; TV;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Architectures, Algorithms and Networks, 2000. I-SPAN 2000. Proceedings. International Symposium on
Conference_Location
Dallas, TX
ISSN
1087-4089
Print_ISBN
0-7695-0936-3
Type
conf
DOI
10.1109/ISPAN.2000.900276
Filename
900276
Link To Document