On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
type: Item
instance of: scholarly article
title: On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
zbMATH Open document ID: 1248.68110
author: Gennaro Cordasco
author: Rosario De Chiara
author: Arnold L. Rosenberg
published in: Journal of Parallel and Distributed Computing
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6097760
zbMATH Keywords: scheduling for dynamically heterogeneous platforms
zbMATH Keywords: \textsc{DAG} scheduling
zbMATH Keywords: cloud computing
zbMATH Keywords: volunteer computing
zbMATH Keywords: desktop grids
describes a project that uses: DAGMan
MaRDI profile type: Publication
full work available at URL: j.jpdc.2012.06.007
OpenAlex ID: W2080162665
cites work: Optimal Linear Ordering
cites work: Extending IC-scheduling via the sweep algorithm
cites work: On clustering \textsc{Dag}s for task-hungry computing platforms
cites work: Q3651735
cites work: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
cites work: Optimization, approximation, and complexity classes
cites work: Q5699657
DOI: 10.1016/J.JPDC.2012.06.007
Recommended article: On scheduling series-parallel DAGs to maximize area
Recommended article: Scheduling DAGs opportunistically: the dream and the reality circa 2016
Recommended article: Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty
Recommended article: Scheduling tree dags on parallel architectures
description: scientific article; zbMATH DE number 6097760