Skip to main content

Load Information Sharing Policies In Communication-Intensive Parallel Applications

  • Chapter
From Grids to Service and Pervasive Computing

Abstract

One usage of Grid infrastructures is to perform parallel computing of scientific applications, most of the time related to hard sciences (physics, chemistry, biology). To exploit parallelism most of these applications are intensive communicated in data and synchronisation messages. On this context, grid systems have to take in account to not interfering with the normal execution of applications. Starting from this idea, in this article we present a study of information sharing policies used by load-balancing algorithms developed for the middleware ProActive, analyzing the performance scalability of: response time (time of reaction against instabilities) and bandwidth, from a communication-intensive application context. We divided the policies into: Centralized or Distributed oriented; and Eager or Lazy load information sharing. Our experimental results show that Eager Distributed oriented policies have better performance (response time and bandwidth usage).

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Petra Berenbrink, Tom Friedetzky, and Leslie Ann Goldberg. The natural work-stealing algorithm is stable. In IEEE Symposium on Foundations of Computer Science, pages 178-187, 2001.

    Google Scholar 

  2. Javier Bustos-Jimenez, Denis Caromel, Alexandre Di Costanzo, Mario Leyton, and Jose Piquer. Balancing active objects on a peer to peer infrastructure. In Proceedings of XXV International Conference of SCCC, Valdivia, Chile. IEEE CS Press, November 2005.

    Google Scholar 

  3. T. L. Casavant and J. G. Kuhl. Effects of response and stability on scheduling in distributed computing systems. IEEE Trans. Softw. Eng., 14(11):1578-1588, 1988.

    Article  Google Scholar 

  4. Steve J. Chapin, Dimitrios Katramatos, John Karpovich, and Andrew S. Grimshaw. The Legion resource management system. In Dror G. Feitelson and Larry Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 162-178. Springer Verlag, 1999.

    Google Scholar 

  5. Wilfired Klauser Denis Caromel and Julien Vayssiere. Towards seamless computing and metacomputing in java. Concurrency Practice and Experience, 1998.

    Google Scholar 

  6. Elisa Heymann, Miquel A. Senar, Emilio Luque, and Miron Livny. Adaptive scheduling for master-worker applications on the computational grid. In GRID, pages 214-227, 2000.

    Google Scholar 

  7. Fabrice Huet, Denis Caromel, and Henri Bal. A high performance java middleware with a real application. In Proc. of High Performance Computing, Networking and Storage (SC2004), Pittsburgh, USA, 2004.

    Google Scholar 

  8. Miron Livny Michael Litzkow and Matt Mutka. Condor - a hunter of idle workstations. In Proc. of 8th International Conference on Distribuited Computing Systems, pages 104-111, 1998.

    Google Scholar 

  9. M. Mitzenmacher. How useful is old information? IEEE Transactions on Parallel and Distributed Systems, 11(1):6-34, 2000.

    Article  MathSciNet  Google Scholar 

  10. J.L. Bosque Orero, D. Gil Marco, and L. Pastor. Dynamic load balancing in heteroge- neous clusters. In Proc. of IASTED International Conference on Parallel and Distributed Computing and Networks, 2004.

    Google Scholar 

  11. Niranjan G. Shivaratri, Phillip Krueger, and Mukesh Singhal. Load distributing for locally distributed systems. IEEE Computer, 25(12):33-44, 1992.

    Google Scholar 

  12. M. M. Theimer and K. A. Lantz. Finding idle machines in a workstation-based distributed system. IEEE Trans. Softw. Eng., 15(11):1444-1458, 1989.

    Article  Google Scholar 

  13. W. Zhu, C. Steketee, and B. Muilwijk. Load balancing and workstation autonomy on amoeba. Australian Computer Science Communications, 17(1):588-597, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Jimenez, J.B., Caromel, D., Leyton, M., Piquer, J. (2008). Load Information Sharing Policies In Communication-Intensive Parallel Applications. In: Priol, T., Vanneschi, M. (eds) From Grids to Service and Pervasive Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09455-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09455-7_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09454-0

  • Online ISBN: 978-0-387-09455-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics