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

Full description

Bibliographic Details

Published in:	SC18: International Conference for High Performance Computing, Networking, Storage and Analysis pp. 466 - 477
Main Authors:	Demirci, Gokalp, Marincic, Ivana, Hoffmann, Henry
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2018
Subjects:	Approximation algorithms configuration DAG Greedy algorithms power precedence Processor scheduling Program processors resource Schedules Scheduling Task analysis
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!