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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Dutot, P. F., Netto, M. A. S., Goldman, A., & Kon, F. (2006). Scheduling moldable BSP tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3834 LNCS, pp. 157–172). https://doi.org/10.1007/11605300_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
