Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Applying Process Migration on a BSP-Based LU Decomposition Application

  • Conference paper
High Performance Computing for Computational Science – VECPAR 2010 (VECPAR 2010)

Abstract

Process migration is an useful mechanism to offer load balancing. In this context, we developed a model called MigBSP that controls processes rescheduling on BSP applications. MigBSP is especially pertinent to obtain performance on this type of applications, since they are composed by supersteps which always wait for the slowest process. In this paper, we focus on the BSP-based modeling of the widely used LU Decomposition algorithm as well as its execution with MigBSP. The use of multiple metrics to decide migrations and adaptations on rescheduling frequency turn possible gains up to 19% over our cluster-of-clusters architecture. Finally, our final idea is to show the possibility to get performance in LU effortlessly by using novel migration algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aggarwal, G., Motwani, R., Zhu, A.: The load rebalancing problem. In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 258–265. ACM Press, New York (2003)

    Chapter  Google Scholar 

  2. Bhandarkar, M.A., Brunner, R., Kale, L.V.: Run-time support for adaptive load balancing. In: IPDPS 2000: Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing, pp. 1152–1159. Springer, London (2000)

    Google Scholar 

  3. Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford University Press, Oxford (2004)

    Book  MATH  Google Scholar 

  4. Bonorden, O.: Load balancing in the bulk-synchronous-parallel setting using process migrations. In: 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), pp. 1–9. IEEE, Los Alamitos (2007)

    Chapter  Google Scholar 

  5. Bonorden, O., Gehweiler, J., auf der Heide, F.M.: Load balancing strategies in a web computing environment. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 839–846. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Casanova, H., Legrand, A., Quinson, M.: Simgrid: A generic framework for large-scale distributed experiments. In: Tenth International Conference on Computer Modeling and Simulation (uksim), pp. 126–131. IEEE Computer Society, Los Alamitos (2008)

    Chapter  Google Scholar 

  7. Chen, L., Wang, C.-L., Lau, F.: Process reassignment with reduced migration cost in grid load rebalancing. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1–13 (April 2008)

    Google Scholar 

  8. da Rosa Righi, R., Pilla, L., Carissimi, A., Navaux, P.O.A.: Controlling processes reassignment in bsp applications. In: 20th International Symposium on Computer Architecture and high Performance Computing (SBAC-PAD 2008), pp. 37–44. IEEE Computer Society, Los Alamitos (2008)

    Chapter  Google Scholar 

  9. da Rosa Righi, R., Pilla, L.L., Carissimi, A., Navaux, P., Heiss, H.-U.: Migbsp: A novel migration model for bulk-synchronous parallel processes rescheduling. In: 10th IEEE International Conference on High Performance Computing and Communications, pp. 585–590 (2009)

    Google Scholar 

  10. Frachtenberg, E., Schwiegelshohn, U.: New Challenges of Parallel Job Scheduling. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2007. LNCS, vol. 4942, pp. 1–23. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Galindo, I., Almeida, F., Badía-Contelles, J.M.: Dynamic load balancing on dedicated heterogeneous systems. In: Lastovetsky, A., Kechadi, T., Dongarra, J. (eds.) EuroPVM/MPI 2008. LNCS, vol. 5205, pp. 64–74. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Gustavson, F.G.: High-performance linear algebra algorithms using new generalized data structures for matrices. IBM J. Res. Dev. 47(1), 31–55 (2003)

    Article  MathSciNet  Google Scholar 

  13. Huang, C., Zheng, G., Kalé, L., Kumar, S.: Performance evaluation of adaptive mpi. In: PPoPP 2006: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 12–21. ACM Press, New York (2006)

    Google Scholar 

  14. Jiang, Y., Tong, W., Zhao, W.: Resource load balancing based on multi-agent in servicebsp model. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4489, pp. 42–49. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Low, M.Y.-H., Liu, W., Schmidt, B.: A parallel bsp algorithm for irregular dynamic programming. In: Xu, M., Zhan, Y.-W., Cao, J., Liu, Y. (eds.) APPT 2007. LNCS, vol. 4847, pp. 151–160. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Maassen, J., van Nieuwpoort, R.V., Kielmann, T., Verstoep, K., den Burger, M.: Middleware adaptation with the delphoi service. Concurrency and Computation: Practice & Experience (2006)

    Google Scholar 

  17. Pontelli, E., Le, H.V., Son, T.C.: An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling. Comput. Lang. Syst. Struct. 36(2), 158–202 (2010)

    Google Scholar 

  18. Qin, X., Jiang, H., Manzanares, A., Ruan, X., Yin, S.: Communication-aware load balancing for parallel applications on clusters. IEEE Trans. Comput. 59(1), 42–52 (2010)

    Article  MathSciNet  Google Scholar 

  19. Silva, R.E., Pezzi, G., Maillard, N., Diverio, T.: Automatic data-flow graph generation of mpi programs. In: SBAC-PAD 2005: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing, Washington, DC, USA, pp. 93–100. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  20. Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103–111 (1990)

    Article  Google Scholar 

  21. Wieczorek, M., Podlipnig, S., Prodan, R., Fahringer, T.: Bi-criteria scheduling of scientific workflows for the grid. ccgrid, 9–16 (2008)

    Google Scholar 

  22. Xhafa, F., Abraham, A.: Computational models and heuristic methods for grid scheduling problems. Future Gener. Comput. Syst. 26(4), 608–621 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

da Rosa Righi, R., Lima Pilla, L., Carissimi, A., Navaux, P.O.A., Heiss, HU. (2011). Applying Process Migration on a BSP-Based LU Decomposition Application. In: Palma, J.M.L.M., Daydé, M., Marques, O., Lopes, J.C. (eds) High Performance Computing for Computational Science – VECPAR 2010. VECPAR 2010. Lecture Notes in Computer Science, vol 6449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19328-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19328-6_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19327-9

  • Online ISBN: 978-3-642-19328-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics