Centralized versus Distributed Schedulers for Bag-of-Tasks Applications

Authors:
Olivier Beaumont;Larry Carter;Jeanne Ferrante;Arnaud Legrand;Loris Marchal;Yves Robert
Affiliations:
-;-;-;-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2008

Citing 0
Cited 12

Toward a fully decentralized algorithm for multiple bag-of-tasks application scheduling on grids

GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Virtual Organization Clusters: Self-provisioned clouds on the grid

Future Generation Computer Systems
Scaling virtual organization clusters over a wide area network using the Kestrel workload management system

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Non-clairvoyant scheduling of multiple bag-of-tasks applications

EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Scalability limits of Bag-of-Tasks applications running on hierarchical platforms

Journal of Parallel and Distributed Computing
Dynamic scheduling of a batch of parallel task jobs on heterogeneous clusters

Parallel Computing
A Highly Scalable Decentralized Scheduler of Tasks with Deadlines

GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Coordinated rescheduling of Bag-of-Tasks for executions on multiple resource providers

Concurrency and Computation: Practice & Experience
Energy-efficient deadline scheduling for heterogeneous systems

Journal of Parallel and Distributed Computing
Scalable distributed architecture for media transcoding

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Cooperative scheduling mechanism for large-scale peer-to-peer computing systems

Journal of Network and Computer Applications
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.