The allocation and scheduling of precedence- and timing-constrained tasks with communication delays

Author

Cheng, Bo-Chao ; Stoyenko, Alexander D. ; Marlowe, Thomas J. ; Baruah, Sanjoy

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

fYear

1996

fDate

21-25 Oct. 1996

Firstpage

91

Lastpage

94

Abstract

The problem of non-preemptively scheduling a set of n tasks on m identical processors with communication overhead subject to precedence and deadline constraints is considered. A new heuristic with the time complexity of O(n/sup 2/m), Least Space-Time First (LSTF), is proposed to minimize the maximum tardiness. From simulation results, it is shown that LSTF outperforms other heuristic algorithms.

Keywords

resource allocation; Least Space-Time First; communication delays; communication overhead; deadline constraints; heuristic; heuristic algorithms; nonpreemptive scheduling; precedence-constrained tasks; simulation results; tardiness; task allocation; task scheduling; time complexity; timing-constrained tasks; Concurrent computing; Delay effects; Distributed computing; Hardware; Heuristic algorithms; Information science; Optimal scheduling; Processor scheduling; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Engineering of Complex Computer Systems, 1996. Proceedings., Second IEEE International Conference on

Conference_Location

Montreal, Que.

Print_ISBN

0-8186-7614-0

Type

conf

DOI

10.1109/ICECCS.1996.558389

Filename

558389