Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4331))

Abstract

This paper discusses the dynamic and static balancing of non-homogenous cluster architectures, simultaneously analyzing the theoretical parallel speedup as well as the speedup experimentally obtained.

A classical application (Parallel N-Queens) with a parallel solution algorithm, where processing predominates upon communication, has been chosen so as to go deep in the load balancing aspects (dynamic or static) without distortion of results caused by communication overhead.

Four interconnected clusters have been used in which the machines within each cluster have homogeneous processors although different among clusters. Thus, the set can be seen as a N-processor heterogeneous cluster or as a multi-cluster scheme with 4 subsets of homogeneous processors.

At the same time, three forms of load distribution in the processors (Direct Static, Predictive Static and Dynamic by Demand) have been studied, analyzing in each case parallel speedup and load unbalancing regarding problem size and the processors used.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Al-Jaroodi, J., Mohamed, N., Jiang, H., Swanson, D.: Modeling parallel applications performance on heterogeneous system. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  2. Bohn, C., Lamont, G.: Load balancing for heterogeneous clusters of PCs. Future Generation Computer Systems, Elsevier Science B.V. 18, 389–400 (2002)

    Article  Google Scholar 

  3. Leopold, C.: Parallel and distributed computing. A survey of models, paradigms, and approaches. Wiley Series on Parallel and Distributed Computing. Albert Zomaya Series Editor (2001)

    Google Scholar 

  4. Baiardi, F., Chiti, S., Mori, P., Ricci, L.: Integrating load balancing and locality in the parallelization of irregular problems. Future Generation Computer Systems, Elsevier Science B 17, 969–975 (2001)

    Article  MATH  Google Scholar 

  5. Naiouf, M.: Procesamiento paralelo. Balance dinámico de carga en algoritmos de sorting. Tesis doctoral. Universidad Nacional de La Plata, (2004)

    Google Scholar 

  6. Watts, J., Taylor, S.: A practical approach to dynamic load balancing. IEEE Transactions on Parallel and Distributed Systems 9(3), 235–248 (1998)

    Article  Google Scholar 

  7. Dongarra, J., Foster, I., Fox, G., Gropp, W., Kennedy, K., Torczon, L., White, A.: The Sourcebook of Parallel Computing. Morgan Kauffman Publishers. Elsevier Science (2003)

    Google Scholar 

  8. Ross, K., Yao, D.: Optimal load balancing and scheduling in a distributed computer system. Journal of Association for Computing Machinery 38(3), 676–690 (1991)

    MATH  Google Scholar 

  9. Hui, C., Chanson, S.: Improve strategies for dynamic load balancing. IEEE Concurrency, 58–67 (1999)

    Google Scholar 

  10. Dongarra, J., Foster, I., Fox, G., Gropp, W., Kennedy, K., Torczon, L., White, A.: The Sourcebook of Parallel Computing. Morgan Kauffman Publishers. Elsevier Science (2003)

    Google Scholar 

  11. Bruen, A., Dixon, R.: Then n-queens problem. Discrete mathematics 12, 393–395 (1997)

    Article  MathSciNet  Google Scholar 

  12. De Giusti, L., Novarini, P., Naiouf, M., De Giusti, A.: Parallelization of the N-queens problem. Load unbalance analysis. Workshop de Procesamiento Paralelo y Distribuido (WPPD), Congreso Argentino de Ciencias de la Computación (CACIC 2003) (2003)

    Google Scholar 

  13. Hedetniemi, S., Hedetniemi, T., Reynolds, R.: Combinatorial problems on chessboards. In: Domination in graphs: advanced topic, pp. 133–162 (1998)

    Google Scholar 

  14. Bernhardsson, B.: Explicit solution to the n-queens problems for all n. ACM SIGART Bulletin 2, 7 (1991)

    Article  Google Scholar 

  15. Somers, J.: The N-queens problem a study in optimization, http://www.jsomers.com/nqueen_demo/nqueens.html

  16. Takaken, N-queens problem (number of solutions), http://www.ic-net.or.jp/home/takaken/e/queen/

  17. De Giusti, L., Chichizola, F.: Optimización de N-queens Paralelo. Technical report III-LIDI (2006)

    Google Scholar 

  18. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to parallel computing, 2nd edn. Pearson Addison Wesley (2003)

    Google Scholar 

  19. Jordan, H., Alaghband, G.: Fundamentals of parallel computing. Prentice-Hall, Englewood Cliffs (2002)

    Google Scholar 

  20. Tinetti, F.: Cómputo paralelo en redes locales de computadoras. Tesis Doctoral. Universidad Autónoma de Barcelona (2004)

    Google Scholar 

  21. Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The Complete Reference. The MIT Press, Cambridge (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Naiouf, M.R., De Giusti, L.C., Chichizola, F., De Giusti, A.E. (2006). Dynamic Load Balancing on Non-homogeneous Clusters. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_8

Download citation

  • DOI: https://doi.org/10.1007/11942634_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

  • Online ISBN: 978-3-540-49862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics