Name
Abstract | ||
|---|---|---|
In this paper, we focus on the problem of scheduling a collection of similar task graphs on a heterogeneous platform, when the task graph is an intree. We rely on steady-state scheduling techniques, and aim at optimizing the throughput of the system. Contrarily to previous studies, we concentrate on practical aspects of steady-state scheduling, when dealing with a collection (or batch) of limited size. We focus here on two optimizations. The first one consists in reducing the processing time of each task graph, thus making steady-state scheduling applicable to smaller batches. The second one consists in degrading a little the optimal-throughput solution to get a simpler solution, more efficient on small batches. We present our optimizations in details, and show that they both help to overcome the limitation of steady-state scheduling: our simulations show that we are able to reach a better efficiency on small batches, to reduce the size of the buffers, and to significantly decrease the processing time of a single task graph (latency). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S0129626411000291 | PARALLEL PROCESSING LETTERS |
Keywords | Field | DocType |
static scheduling, grid computing, steady-state scheduling | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Open-shop scheduling,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
21 | 4 | 0129-6264 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sékou Diakité | 1 | 4 | 1.11 |
| Loris Marchal | 2 | 375 | 36.10 |
| Jean-Marc Nicod | 3 | 95 | 18.10 |
| Laurent Philippe | 4 | 71 | 12.95 |