Skip to main content

A Cellular Automata-Like Scheduler and Load Balancer

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2016)

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

Included in the following conference series:

Abstract

The paper presents a general framework to study issues of effective load balancing and scheduling in highly parallel and distributed computing environments. We propose a novel approach based on the concept of the Sandpile cellular automaton: a decentralized multi-agent system working in a critical state at the edge of chaos. Our goal is providing fairness between concurrent job submissions by minimizing slowdown of individual applications and dynamically rescheduling them to the best suited resources.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Al-Azzoni, I., Down, D.G.: Dynamic scheduling for heterogeneous desktop grids. J. Parallel Distrib. Comput. 70(12), 1231–1240 (2010)

    Article  MATH  Google Scholar 

  2. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality: an explanation of the 1/f noise. Phys. Rev. Lett. 59, 381–384 (1987)

    Article  MathSciNet  Google Scholar 

  3. Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality. Phys. Rev. A 38, 364–374 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beaumont, O., Carter, L.: Centralized versus distributed schedulers for multiple bag-of-task applications. In: 20th International Parallel and Distributed Processing Symposium, IPDPS 2006, p. 10, April 2006

    Google Scholar 

  5. Benoit, A., Marchal, L., Pineau, J.-F., Robert, Y., Vivien, F.: Scheduling concurrent bag-of-tasks applications on heterogeneous platforms. IEEE Trans. Comput. 59(2), 202–217 (2010)

    Article  MathSciNet  Google Scholar 

  6. Brasileiro, F., Araujo, E., Voorsluys, W., Oliveira, M., Figueiredo, F.: Bridging the high performance computing gap : the ourgrid experience. In: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2007, pp. 817–822, Washington, D.C., USA. IEEE Computer Society (2007)

    Google Scholar 

  7. Celaya, J., Marchal, L.: A fair decentralized scheduler for bag-of-tasks applications on desktop grids. In: 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), pp. 538–541, May 2010

    Google Scholar 

  8. Franceschelli, M., Giua, A., Seatzu, C.: Load balancing over heterogeneous networks with gossip-based algorithms. In: Proceedings of the 2009 Conference on American Control Conference, ACC 2009, pp. 1987–1993, Piscataway, NJ, USA. IEEE Press (2009)

    Google Scholar 

  9. Jelasity, M., Montresor, A., Babaoglu, O.: A modular paradigm for building self-organizing peer-to-peer applications. In: Di Marzo Serugendo, G., Karageorgos, A., Rana, O.F., Zambonelli, F. (eds.) ESOA 2003. LNCS (LNAI), vol. 2977, pp. 265–282. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Laredo, J., Bouvry, P., Guinand, F., Dorronsoro, B., Fernandes, C.: The Sandpile scheduler. Cluster Comput. 17(2), 1–14 (2014)

    Article  Google Scholar 

  11. Tchernykh, A., Schwiegelshohn, U., Yahyapour, R., Kuzjurin, N.: On-line hierarchical job scheduling on grids with admissible allocation. J. Sched. 13(5), 545–552 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Viswanathan, S., Veeravalli, B., Robertazzi, T.G.: Resource-aware distributed scheduling strategies for large-scale computational cluster/grid systems. IEEE Trans. Parallel Distrib. Syst. 18(10), 1450–1461 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jakub Gasior .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gasior, J., Seredynski, F. (2016). A Cellular Automata-Like Scheduler and Load Balancer. In: El Yacoubi, S., WÄ…s, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44365-2_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44364-5

  • Online ISBN: 978-3-319-44365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics