Scheduling Moldable BSP Tasks

  • Pierre-François Dutot
  • Marco A. S. Netto
  • Alfredo Goldman
  • Fabio Kon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3834)

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.

Keywords

Execution Time Idle Time Message Passing Interface Parallel Application Parallel Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Foster, I., Kesselman, C. (eds.): The Grid 2: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (2003)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33, 103–111 (1990)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Baker, R., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Ludwig, W.T.: Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis, University of Wisconsin - Madison, Department of Computer Sciences (1995)Google Scholar
  10. 10.
    Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26, 401–409 (1997)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Mounié, G.: Efficient scheduling of parallel application: the monotonic malleable tasks. PhD thesis, Institut National Polytechnique de Grenoble, Available in french only (2000)Google Scholar
  13. 13.
    Mounie, G., Rapine, C., Trystram, D.: A \(\frac{3}{2}\)-approximation algorithm for independent scheduling malleable tasks (submitted for publication 2001)Google Scholar
  14. 14.
    Message Passing Interface Forum: MPI: A Message Passing Interface. In: Proceedings of Supercomputing 1993, pp. 878–883. IEEE Computer Society Press, Los Alamitos (1993)Google Scholar
  15. 15.
    Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and answers about BSP. Journal of Scientific Programming 6, 249–274 (1997)Google Scholar
  16. 16.
    Sunderam, V.S.: PVM: a framework for parallel distributed computing. Concurrency, Practice and Experience 2, 315–340 (1990)CrossRefGoogle Scholar
  17. 17.
    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)MATHCrossRefGoogle Scholar
  18. 18.
    Dehne, F.: Coarse grained parallel algorithms. Algorithmica Special Issue on Coarse grained parallel algorithms 24, 173–176 (1999)MATHGoogle Scholar
  19. 19.
    Gu, Y., Lee, B.S., Cai, W.: JBSP: A BSP Programming Library in Java. Journal of Parallel and Distributed Computing 61, 1126–1142 (2001)MATHCrossRefGoogle Scholar
  20. 20.
    Bonorden, O., Juurlink, B., von Otte, I., Rieping, I.: The paderborn university bsp (pub) library. Parallel Computing 29, 187–207 (2003)CrossRefGoogle Scholar
  21. 21.
    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)CrossRefGoogle Scholar
  22. 22.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, New York (1979)MATHGoogle Scholar
  23. 23.
    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)CrossRefMathSciNetGoogle Scholar
  24. 24.
    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)CrossRefGoogle Scholar
  25. 25.
    Cirne, W., Berman, F.: A model for moldable supercomputer jobs. In: Proceedings of the 15th International Parallel & Distributed Processing Symposium (2001)Google Scholar
  26. 26.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pierre-François Dutot
    • 1
  • Marco A. S. Netto
    • 2
  • Alfredo Goldman
    • 2
  • Fabio Kon
    • 2
  1. 1.Laboratoire ID-IMAGMontbonnotFrance
  2. 2.Department of Computer ScienceUniversity of São PauloSão PauloBrazil

Personalised recommendations