Name
Abstract | ||
|---|---|---|
Scheduling and dispatching are critical enabling technologies in supercomputing and grid computing. In these contexts, scalability is an issue: we have to allocate and schedule upï¾źto tens of thousands of tasks on tens of thousands of resources. This problem scale is out of reach for complete and centralized scheduling approaches. We propose a distributed allocation and scheduling paradigm called DARDIS that is lightweight, scalable and fully customizable in many domains. In DARDIS each task offloads to the available resources the computation of a probability index associated with each possible start time for the given task on the specific resource. The task then selects the proper resource and start time on the basis of the above probability. The scheduler can be customized with different policies to fit several objective functions like load balancing or makespan. We evaluate our approach in the domain of grids and supercomputers. We compare DARDIS with the most widely used algorithms used in these specific domains to show that this approach can reach better solutions in several cases. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-49130-1_36 | ECAI |
Keywords | DocType | Volume |
Distributed scheduling,Variable constraints,Soft/Hard constraints | Conference | 10037 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
16 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Bridi | 1 | 10 | 1.17 |
| Michele Lombardi | 2 | 270 | 28.86 |
| Andrea Bartolini | 3 | 457 | 51.90 |
| Luca Benini | 4 | 13116 | 1188.49 |
| Michela Milano | 5 | 1117 | 97.67 |