A Divide and Conquer Algorithm for DAG Scheduling under Power Constraints

We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global resource constraint- specifically a global power budget-and configurable resources, allowing a range of different power/performance tradeoffs. The...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SC18: International Conference for High Performance Computing, Networking, Storage and Analysis S. 466 - 477
Hauptverfasser: Demirci, Gokalp, Marincic, Ivana, Hoffmann, Henry
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.11.2018
Schlagworte:
Approximation algorithms
configuration
DAG
Greedy algorithms
power
precedence
Processor scheduling
Program processors
resource
Schedules
Scheduling
Task analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global resource constraint- specifically a global power budget-and configurable resources, allowing a range of different power/performance tradeoffs. There is a rich body of literature on the independent problems of (1) scheduling DAGs and (2) scheduling independent applications under resource constraints. Very little, however, is known about the combined problem of scheduling DAGs under resource constraints. We present a novel approximation algorithm using a divide-and-conquer method for minimizing application execution time. We prove that the length of the schedule returned by our algorithm is always within O(log n)-factor of the optimum that can be achieved with any selection of configurations for the tasks. We implement and test our algorithm on simulations of real application DAGs. We find that our divide-and-conquer method improves performance by up to 75% compared to greedy scheduling algorithms.
DOI:10.1109/SC.2018.00039