Centralized Versus Distributed Schedulers for Multiple Bag-of-Task Applications (2006)
| Venue: | IN INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM IPDPS’2006. IEEE COMPUTER |
| Citations: | 23 - 10 self |
BibTeX
@INPROCEEDINGS{Beaumont06centralizedversus,
author = {Olivier Beaumont and Larry Carter and Jeanne Ferrante and Arnaud Legrand and Loris Marchal and Yves Robert},
title = {Centralized Versus Distributed Schedulers for Multiple Bag-of-Task Applications},
booktitle = {IN INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM IPDPS’2006. IEEE COMPUTER},
year = {2006},
publisher = {Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 e#cient execution on a distributed network of processors. We limit our study to the case where communication is restricted to a tree embedded in the network, and the applications consist of a large number of independent tasks that originate at the tree's root. The tasks of a given application all have the same computation and communication requirements, but these requirements can vary for different applications. Each application is given a weight that quantifies its relative value. The goal of scheduling is to maximize throughput while executing tasks from each application in the same ratio as their weights. We can
