Abstract
A load balancing scheme comprises of three phases: information collection, decision making based on information and data migration. In distributed database, it is important to take data locality into account, since they have big impact on the communication requirements. Several techniques are proposed for balancing the load in homogeneous applications but still some improvement in terms of efficiency is required. In this paper, we present a load balancing architecture that can deal with homogeneous applications in distributed database [3] more efficiently. In our proposed architecture, memory utilization based priority method is used and data locality is also taken into consideration along with process waiting time and data transmission time. We have developed a load balancing algorithm which balances the load on different nodes working in homogeneous environment in a fragmented distributed database.
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
Sharma, S., Singh, S., Sharma, M.: Performance Analysis of Load Balancing Algorithms. World Academy of Science, Engineering and Technology (PWASET) 28, 208–267 (2008)
Hamam, Y., Hindi, K.S.: Assignment of program modules to processors: A simulated annealing approach. European Journal of Operational Research 122(2), 509–513 (2008)
Amiri, A.: A Coordinated Planning Model for the Design of a Distributed Database System. Information Sciences 164, 229–245 (2004)
Li, W., Altintas, K., Kantarcıolu, M.: On Demand Synchronization and Load Distribution for Database Grid-Based Web Applications. Data and Knowledge Engineering 51(3), 295–323 (2004)
Yoshida, M., Sakamoto, K.: Code Migration Control in Large Scale Loosely Coupled Distributed Systems. In: Proceedings of the 4th International Conference on Mobile Technology, Applications and Systems, Singapore, September 2007, vol. 65, pp. 345–455 (2007)
Markatos, E.P., LeBlanc, T.J.: Load Balancing vs. Shared-Memory Multiprocessors. In: 21th International Conference on Parallel Processing, August 1992, vol. 22, pp. 234–345 (1992)
Hummel, S.F., Schonberg, E., Flynn, L.E.: Factoring: A Practical and Robust Method for Scheduling Parallel Loops. In: IEEE Supercomputing 1991, Albuquerque, vol. 1, pp. 610–619 (November 1991)
Kruskal, C., Weiss, A.: Allocating Independent Subtasks on Parallel Processors. IEEE Transaction on Software Engineering, SE-10, 10 (October 1985)
Lin, F.C.H., Keller, R.M.: The Gradient model load balancing method. IEEE Transaction on Software Engineering, SE-13 1, 32–38 (1987)
Lucco, S.: A Dynamic Scheduling Method for Irregular Parallel Programs. In: SIGPLAN 1992 Conference on Programming Language Design and Implementation, June 1992, vol. 2, pp. 200–211. ACM, San Francisco (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batra, N., Kapil, A.K. (2010). NEEMON Algorithm Based on Data Locality for Priority Based Dynamic Load Balancing in Distributed Database. In: Das, V.V., et al. Information Processing and Management. BAIP 2010. Communications in Computer and Information Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12214-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-12214-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12213-2
Online ISBN: 978-3-642-12214-9
eBook Packages: Computer ScienceComputer Science (R0)