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

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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bo-Chao Cheng, Stoyenko, A.D., Marlowe, T.J., Baruah, S.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Concurrent computing
Delay effects
Distributed computing
Hardware
Heuristic algorithms
Information science
Optimal scheduling
Processor scheduling
Space technology
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ICECCS.1996.558389