Scheduling multiple DAGs onto heterogeneous systems
The work
| Authors | Henan Zhao; Rizos Sakellariou |
|---|---|
| Editors | |
| Type | misc |
| Year | 2006 |
| Citekey | zhao2006scheduling |
Where it appeared
| Published in | IEEE International Parallel and Distributed Processing Symposium (IPDPS) |
|---|---|
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 14 pp. |
Identifiers
| DOI | 10.1109/ipdps.2006.1639387 |
|---|---|
| OpenAlex | W2524532577 |
Access
| Landing page | https://doi.org/10.1109/ipdps.2006.1639387 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
The problem of scheduling a single DAG onto heterogeneous systems has been studied extensively. In this paper, we focus on the problem of scheduling more than one DAG at the same time onto a set of heterogeneous resources. The aim is not only to optimize the overall makespan, but also to achieve fairness, defined on the basis of the slowdown that each DAG would experience as a result of competing for resources with other DAGs. Two policies particularly focussing to deliver fairness are presented and evaluated along with another four policies that can be used to schedule multiple DAGs.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-29 06:07 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{zhao2006scheduling,
title = {Scheduling multiple DAGs onto heterogeneous systems},
author = {Henan Zhao and Rizos Sakellariou},
year = {2006},
journal = {IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
publisher = {Institute of Electrical and Electronics Engineers},
pages = {14 pp.},
doi = {10.1109/ipdps.2006.1639387},
}
This record lives at https://refs.drheap.org/zhao2006scheduling/ and will keep doing so.