Name
Abstract | ||
|---|---|---|
In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, different solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03869-3_22 | Euro-Par |
Keywords | Field | DocType |
limited size,previous study,mixed integer program,steady-state scheduling,different solution,identical task trees,heterogeneous platform,task graph,optimal throughput,comprehensive simulation,identical task graph,steady state | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Open-shop scheduling,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | ISSN | Citations |
5704 | 0302-9743 | 2 |
PageRank | References | Authors |
0.39 | 10 | 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 |