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

Complexity Analysis of Load Balance Problem for Synchronous Iterative Applications

  • Conference paper
Grid and Cooperative Computing - GCC 2004 (GCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3251))

Included in the following conference series:

  • 318 Accesses

Abstract

Load balance technologies for tightly coupled applications on the large scale heterogeneous cluster systems are paid more and more attentions nowadays with the emergence of the Meta computing and Grid computing environment. Focusing on a class of representative tightly coupled applications, synchronous iterative applications, we formulate their load balance problem into a combination optimization problem. Meanwhile, we establish a complexity result that accesses the difficulty of the problem. The theory analysis result will do great help for the design of approximate 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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Boudet, V., Rastello, F., Robert, Y.: Algorithmic issues for (distributed) heterogeneous computing platforms. In: Buyya, R., Cortes, T. (eds.) Cluster Computing Technologies, Environments, and Applications (CC-TEA 1999), pp. 09–712. CSREA Press (1999)

    Google Scholar 

  2. Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  3. Matyska, L., Ruda, M.: Metacomputing. New direction in high performance computing. In: Information Technology Applications in Biomedicine, ITAB 1997 (1997), Proceedings of the IEEE Engineering in Medicine and Biology Society Region 8 International Conference, September 7-9, pp. 106–108 (1997)

    Google Scholar 

  4. Fox, G.C., Williams, R.D., Messina, P.C.: Parallel Computing Works! Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  5. Vadhiyar, S.S., Dongarra, J.J.: A metascheduler for the Grid. In: Proceedings of 11th IEEE International Symposium on High Performance Distributed Computing, HPDC-11, July 23-26 (2002)

    Google Scholar 

  6. Weissman, J.B.: Metascheduling: A scheduling model for metacomputing systems. In: Proceedings of The Seventh International Symposium on High Performance Distributed Computing, July 28-31, pp. 348–349 (1998)

    Google Scholar 

  7. Yang, D.: A Parallel Iterative Domain Decomposition Algorithm for Elliptic Problems. Journal of Computational Mathematics 16, 141–151 (1998)

    MATH  Google Scholar 

  8. Mardal, K.-A., Langtangen, H.P.: An efficient parallel iterative approach to a fully implicit mixed finite element formulation for the Navier-Stokes equations. In: ECCOMAS CFD 2001 Computational Fluid Dynamics Conference Proceedings (2001)

    Google Scholar 

  9. Wilkinson, B., Michael, A.: Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Computers. Prentice Hall, Englewood Cliffs (1999)

    Google Scholar 

  10. Brochard, L., Prost, J.-P., Faurie, F.: Synchronization and load unbalance effects of parallel iterative algorithms. In: Proc. Int. Conf. on Parallel Processing, St Charles, IL, vol. 1, pp. 153–60. The Pennsylvania State University Press, University Park

    Google Scholar 

  11. Dubois, M., Briggs, F.A.: Performance of synchronized iterative processes in multiprocessor systems. IEEE Trans. Software Engng. SE-8, 419–431 (1982)

    Article  Google Scholar 

  12. Kruskal, C.P., Weiss, A.: Allocating independent subtasks on parallel processors. IEEE Trans. Soft. Engng. SE-11, 1001–1016 (1985)

    Article  Google Scholar 

  13. Adams, M.F.: A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers. In: Proceedings of the 2001 ACM/IEEE conference on Supercomputing, Conference on High Performance Networking and Computing archive, pp. 4–4 (2001)

    Google Scholar 

  14. Chen, C.-M., Lee, S.-Y.: On parallelizing the EM algorithm for PET image reconstruction. IEEE Transactions on Parallel and Distributed Systems 5(8), 860–873 (1994)

    Article  Google Scholar 

  15. Yang, L.T.: Data distribution and communication schemes for IQMR method on massively distributed memory computers. In: Proceedings of 2000 International Workshops on Parallel Processing 2000, August 21-24, pp. 299–306 (2000)

    Google Scholar 

  16. Walker, E., Morgan, G.: Pipeline ring data-flow architecture for solving large iterative structures, Computers and Digital Techniques. IEE Proceedings 141(4), 212–220 (1994)

    Article  Google Scholar 

  17. Legrand, A., Renard, H., Robert, Y., Vivien, F.: Load-balancing iterative computations on heterogeneous clusters with shared communication links. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 930–937. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Renard, H., Robert, Y., Vivien, F.: Static load-balancing techniques for iterative computations on heterogeneous clusters. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 148–159. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, W., Hu, M. (2004). Complexity Analysis of Load Balance Problem for Synchronous Iterative Applications. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23564-4

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics