Task scheduling in multiprocessing systems using duplication

Task scheduling in multiprocessing systems using duplication

Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG)...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of systems architecture 2008-05, Vol.54 (5), p.519-529
Hauptverfasser: Chaudhuri, Pranay, Elcock, Jeffrey
Format: Artikel
Sprache:eng
Schlagworte:
Distributed algorithm
Distributed computing environment
Distributed processing
Microprocessors
Optimal schedule
Optimization
Scheduling algorithms
Studies
Task scheduling
Time complexity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of O ( d | V | 3 ) , where ∣ V∣ represents the number of tasks and d the maximum indegree of tasks.
ISSN:1383-7621
1873-6165
DOI:10.1016/j.sysarc.2007.09.004