Scheduling moldable BSP tasks

Authors:
Pierre-François Dutot;Marco A. S. Netto;Alfredo Goldman;Fabio Kon
Affiliations:
Laboratoire ID-IMAG, Montbonnot, France;Department of Computer Science, University of São Paulo, São Paulo, Brazil;Department of Computer Science, University of São Paulo, São Paulo, Brazil;Department of Computer Science, University of São Paulo, São Paulo, Brazil
Venue:
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Year:
2005

Citing 19
Cited 3

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A bridging model for parallel computation

Communications of the ACM
PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Approximate algorithms scheduling parallelizable tasks

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
MPI: a message passing interface

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Algorithms for scheduling malleable and nonmalleable parallel tasks

Algorithms for scheduling malleable and nonmalleable parallel tasks
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
Efficient approximation algorithms for scheduling malleable tasks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
BSPlib: The BSP programming library

Parallel Computing
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
JBSP: a BSP programming library in Java

Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Model for Moldable Supercomputer Jobs

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
The Paderborn University BSP (PUB) library

Parallel Computing
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
Checkpointing-based rollback recovery for parallel applications on the InteGrade grid middleware

MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
InteGrade object-oriented Grid middleware leveraging the idle computing power of desktop machines: Research Articles

Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
A parallel programming environment on grid

ICCS'03 Proceedings of the 1st international conference on Computational science: PartI

The implementation of the BSP parallel computing model on the InteGrade Grid middleware

MGC '05 Proceedings of the 3rd international workshop on Middleware for grid computing
An experimental approach for job scheduling optimizationto improve the system usage efficiency

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
Job scheduling using successive linear programming approximations of a sparse model

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use fewer processors than the original required, but with a particular cost model. We discuss the problem of scheduling a batch of BSP tasks on a fixed number of computers. The objective is to minimize the completion time of the last task (makespan). We show that the problem is difficult and present approximation algorithms and heuristics. We finish the paper presenting the results of extensive simulations under different workloads.