The Community for Technology Leaders
Green Image
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of fairly and efficiently scheduling Bags of Tasks applications on a distributed network of processors organized as a tree. The goal of scheduling is to maximize throughput of each application while ensuring a fair sharing of resources between applications. We particularly investigate decentralized schedulers that use only local information at each participating resource and we assess their performance via simulation, and compare to an optimal centralized solution obtained via linear programming.
Distributed architectures, Scheduling and task partitioning, Linear programming

O. Beaumont, L. Carter, L. Marchal, J. Ferrante, Y. Robert and A. Legrand, "Centralized versus Distributed Schedulers for Bag-of-Tasks Applications," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 698-709, 2007.
80 ms
(Ver 3.3 (11022016))