Abstract
In this paper, we propose consensus based load balancing algorithm for network of heterogeneous workstations. Load balancing is a critical issue in parallel and distributed computing in order to carry out efficient utilization of computational resources. The focus of this work is to design a dynamic decentralized load balancing algorithm for a network of heterogeneous workstations using consensus theory and graph partitioning. Simulation results show that the proposed load balancing algorithm is scalable, reliable, fault tolerant and maintains a balance between communication overhead and load balancing time.
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.
Similar content being viewed by others
References
Janhavi, B., Surve, S., Prabhu, S.: Graph Partitioning for a Network of Heterogeneous Workstations. In: International Conference on Advances in Communication, Network and Computing, Kerala (2010)
Yagoubi, B., Slimani, Y.: Task Load Balancing Strategy for Grid Computing. Journal of Computer Science 3(3), 186–194 (2007)
Abed, Oz, G., Kostin, A.: Competition-Based Load Balancing for Distributed Systems. In: Proceedings of the Seventh IEEE International Symposium on Computer Networks, pp. 230–235 (2006)
Shah, R., Veeravalli, B., Misra, M.: On the Design of Adaptive and Decentralized Load-Balancing Algorithms with Load Estimation for Computational Grid Environments. IEEE Transactions on Parallel and Distributed Systems 18, 1675–1687 (2007)
Venu Gopalachari, M., Sammulal, P., Vinaya Babu Dr., A.: Correlating Scheduling and Load balancing to achieve optimal performance from a cluster. In: International Advance Computing Conference, pp. 320–325 (2009)
Chandra, P., Sahoo, B.: Dynamic Load Distribution Algorithm Performance in Heterogeneous Distributed System for 1/0- intensive Task. In: IEEE Region 10 Conference, pp. 1–5 (2008)
Khan, M.S., Li, F.: Fast Graph Partitioning Algorithms. In: Proc. IEEE Pacific Rim Conference on Communications Computers and Signal Processing, pp. 337–342 (1995)
Eren, T., Brian, D., Morse, A.S., Whiteley, W., Belhumeur, P.L.: Operations on Rigid Formations of Autonomous Agents. Communications in Information and Systems 3(4), 223–258 (2004)
Farcas, K., Hossman, T., Plattner, B., Ruf, L.: NWC: Node Weight Computation in MANETs’. In: Proceedings of 16th International Conference on Computer Communications and Networks, pp. 1059–1064 (2007)
Neiger, G.: Distributed Consensus Revisited. Information Processing Letters, 195–201 (1994)
Aspnes, J.: Randomized Protocols for Asynchronous Consensus. Distributed Computing 16(2-3), 165–175 (2003)
Janhavi, B., Surve, S., Prabhu, S.: Comparison of Load Balancing Algorithms in a Grid. In: International Conference on Data Storage and Data Engineering, Bangalore, pp. 20–23 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baikerikar, J., Surve, S., Prabhu, S. (2011). Consensus Based Dynamic Load Balancing for a Network of Heterogeneous Workstations. In: Unnikrishnan, S., Surve, S., Bhoir, D. (eds) Advances in Computing, Communication and Control. ICAC3 2011. Communications in Computer and Information Science, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18440-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-18440-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18439-0
Online ISBN: 978-3-642-18440-6
eBook Packages: Computer ScienceComputer Science (R0)