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

Celý popis

Podrobná bibliografia

Vydané v:	SC18: International Conference for High Performance Computing, Networking, Storage and Analysis s. 466 - 477
Hlavní autori:	Demirci, Gokalp, Marincic, Ivana, Hoffmann, Henry
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2018
Predmet:	Approximation algorithms configuration DAG Greedy algorithms power precedence Processor scheduling Program processors resource Schedules Scheduling Task analysis
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!