Centralized Versus Distributed Schedulers Multiple Bag-of-Task Applications - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Centralized Versus Distributed Schedulers Multiple Bag-of-Task Applications

(1, 2) , (3) , (3) , (4) , (5, 6) , (6, 5)
1
2
3
4
5
6

Abstract

Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of scheduling applications to ensure fair and efficient execution on master-worker platforms where the communication is restricted to a tree embedded in the network. The goal of the scheduling is to obtain the best throughput while enforcing some fairness between applications. We show how to derive an asymptotically optimal periodic schedule by solving a linear program expressing all problem constraints. For single-level trees, the optimal solution can be analytically computed. For large-scale platforms, gathering the global knowledge needed by the linear programming approach might be unrealistic. One solution is to adapt the multi-commodity flow algorithm of Awerbuch and Leighton, but it still requires some global knowledge. Thus, we also investigates heuristic solutions using only local information, and test them via simulations. The best of our heuristics achieves the optimal performance on about two-thirds of our test cases, but is far worse in a few cases.

Dates and versions

hal-00789440 , version 1 (18-02-2013)

Identifiers

Cite

Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, et al.. Centralized Versus Distributed Schedulers Multiple Bag-of-Task Applications. International Parallel and Distributed Processing Symposium IPDPS'2006, 2006, Rhodes Island, Greece. ⟨10.1109/TPDS.2007.70747⟩. ⟨hal-00789440⟩
394 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More