Scheduling Moldable BSP Tasks | Zendy

Pierre-François Dutot | Zendy; Marco A. S. Netto | Zendy; Alfredo Goldman | Zendy; Fábio Kon | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Scheduling Moldable BSP Tasks

Author(s) -

Pierre-François Dutot,

Marco A. S. Netto,

Alfredo Goldman,

Fábio Kon

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-31024-X

DOI - 10.1007/11605300_8

Subject(s) - computer science , heuristics , scheduling (production processes) , job shop scheduling , parallel computing , distributed computing , mathematical optimization , computer network , operating system , mathematics , routing (electronic design automation)

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research