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.
Research supported by a grant from CNPq, Brazil – grant number: 55.2028/02-9.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Foster, I., Kesselman, C. (eds.): The Grid 2: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (2003)
Goldchleger, A., Kon, F., Goldman, A., Finger, M., Bezerra, G.C.: InteGrade: Object-Oriented Grid Middleware Leveraging Idle Computing Power of Desktop Machines. Concurrency and Computation: Practice and Experience 16, 449–459 (2004)
Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33, 103–111 (1990)
Goldchleger, A., Queiroz, C.A., Kon, F., Goldman, A.: Running highly-coupled parallel applications in a computational grid. In: Proceedings of the 22nd Brazilian Symposium on Computer Networks (2004)
Hill, J.M.D., McColl, B., Stefanescu, D.C., Goudreau, M.W., Lang, K., Rao, S.B., Suel, T., Tsantilas, T., Bisseling, R.H.: BSPlib: The BSP programming library. Parallel Computing 24, 1947–1980 (1998)
Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms for scheduling parallelizable tasks. In: Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, SIGACT/SIGARCH, pp. 323–332 (1992)
Baker, R., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)
Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 9, 808–826 (1980)
Ludwig, W.T.: Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis, University of Wisconsin - Madison, Department of Computer Sciences (1995)
Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26, 401–409 (1997)
Mounie, G., Rapine, C., Trystram, D.: Efficient approximation algorithm for scheduling malleable tasks. In: Proceedings of the 11th ACM Symposium of Parallel Algorithms and Architecture, pp. 23–32 (1999)
Mounié, G.: Efficient scheduling of parallel application: the monotonic malleable tasks. PhD thesis, Institut National Polytechnique de Grenoble, Available in french only (2000)
Mounie, G., Rapine, C., Trystram, D.: A \(\frac{3}{2}\)-approximation algorithm for independent scheduling malleable tasks (submitted for publication 2001)
Message Passing Interface Forum: MPI: A Message Passing Interface. In: Proceedings of Supercomputing 1993, pp. 878–883. IEEE Computer Society Press, Los Alamitos (1993)
Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and answers about BSP. Journal of Scientific Programming 6, 249–274 (1997)
Sunderam, V.S.: PVM: a framework for parallel distributed computing. Concurrency, Practice and Experience 2, 315–340 (1990)
Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing 22, 789–828 (1996)
Dehne, F.: Coarse grained parallel algorithms. Algorithmica Special Issue on Coarse grained parallel algorithms 24, 173–176 (1999)
Gu, Y., Lee, B.S., Cai, W.: JBSP: A BSP Programming Library in Java. Journal of Parallel and Distributed Computing 61, 1126–1142 (2001)
Bonorden, O., Juurlink, B., von Otte, I., Rieping, I.: The paderborn university bsp (pub) library. Parallel Computing 29, 187–207 (2003)
Tong, W., Ding, J., Cai, L.: A parallel programming environment on grid. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2657, pp. 225–234. Springer, Heidelberg (2003)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, New York (1979)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM 34, 144–162 (1987)
Mu’alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Transactions Parallel & Distributed Systems 12, 529–543 (2001)
Cirne, W., Berman, F.: A model for moldable supercomputer jobs. In: Proceedings of the 15th International Parallel & Distributed Processing Symposium (2001)
de Camargo, R.Y., Goldchleger, A., Kon, F., Goldman, A.: Checkpointing-based rollback recovery for parallel applications on the integrade grid middleware. In: Proceedings of the 2nd workshop on Middleware for grid computing, pp. 35–40. ACM Press, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dutot, PF., Netto, M.A.S., Goldman, A., Kon, F. (2005). Scheduling Moldable BSP Tasks. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2005. Lecture Notes in Computer Science, vol 3834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605300_8
Download citation
DOI: https://doi.org/10.1007/11605300_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31024-2
Online ISBN: 978-3-540-31617-6
eBook Packages: Computer ScienceComputer Science (R0)