Abstract
Loosely connected distributed computing systems present a changing environment to the programs that they execute. Dynamic load balancing (DLB) algorithms are employed to address the problem of relocating tasks when parts of a distributed computing system become unavailable while other parts become idle. This paper presents a novel DLB algorithm based on cemetery formation in ant colonies. The algorithm builds on previous work to formulate ant-inspired DLB algorithms that aim to reduce the time needed to complete the parallel execution of multiple, independent tasks, where resources as well as tasks are diverse with respect to their performances and durations, respectively. The new algorithm is compared with its predecessors, based on division of labour in ant colonies, and pure, opportunistic load balancing, established as the baseline.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertelle, C., Dutot, A., Guinand, F., Olivier, D.: Organization detection for dynamic load balancing in individual-based simulations. Multiagent and Grid Systems 3(1), 141–163 (2007)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems, 1st edn. Oxford University Press (1999)
Cao, J.: Self-organizing agents for grid load balancing. In: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, pp. 388–395. IEEE Computer Society (2004)
Casavant, T., Kuhl, J.: A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering 14(2), 141–154 (1988)
Deneubourg, J.L., Goss, S., Franks, N., Sendova-hanks, A., Detrain, C., Chrtien, L.: The dynamics of collective sorting: robot-like ants and ant-like robots. In: Meyer, J.A., Wilson, S. (eds.) Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats, pp. 356–363 (1991)
Freund, R.F., Siegel, H.J.: Guest editor’s introduction: Heterogeneous processing. Computer 26, 13–17 (1993)
Klazar, R., Engelbrecht, A.P.: Dynamic load balancing inspired by division of labour in ant colonies. In: IEEE Symposium on Swarm Intelligence (SIS), pp. 1–8 (April 2011)
Montresor, A., Meling, H., Babaoğlu, Ö.: Messor: Load-Balancing through a Swarm of Autonomous Agents. In: Moro, G., Koubarakis, M. (eds.) AP2PC 2002. LNCS (LNAI), vol. 2530, pp. 125–137. Springer, Heidelberg (2003)
Theraulaz, G., Bonabeau, E., Nicolis, S.C., Sol, R.V., Fourcassi, V., Blanco, S., Fournier, R., Joly, J.L., Fernndez, P., Grimal, A., Dalle, P., Deneubourg, J.L.: Spatial patterns in ant colonies. Proceedings of the National Academy of Sciences 99(15), 9645–9649 (2002)
Wang, Y.T., Morris, R.J.: Load sharing in distributed systems. IEEE Transactions on Computers C-34(3), 204–217 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klazar, R., Engelbrecht, A.P. (2012). Dynamic Load Balancing Inspired by Cemetery Formation in Ant Colonies. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-32650-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32649-3
Online ISBN: 978-3-642-32650-9
eBook Packages: Computer ScienceComputer Science (R0)