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

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!