Name
Abstract | ||
|---|---|---|
In the context of grid scheduling we consider a scheduling scenario, where parallel jobs have to be scheduled non-preemptively on heterogeneous computational platforms of processors. The speed of the processors may differ among the platforms and the jobs are submitted simultaneously or over time and cannot run across multiple platforms. We focus on the target of minimizing the total makespan, i.e. the global latest finishing time of a job. In this paper we present an AFPTAS for the problem without release times and show how to generalize our result to malleable jobs and jobs with release times. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-22685-4_25 | COCOON |
Keywords | Field | DocType |
multiple platform,scheduling scenario,scheduling job,release time,heterogeneous platform,heterogeneous computational platform,total makespan,global latest finishing time,parallel job | Approximation algorithm,Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Grid scheduling,Strip packing,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 24 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marin Bougeret | 1 | 113 | 13.35 |
| Pierre-françois Dutot | 2 | 166 | 13.95 |
| Klaus Jansen | 3 | 0 | 0.34 |
| Christina Robenek | 4 | 23 | 2.58 |
| Denis Trystram | 5 | 1120 | 160.57 |