Dynamic load balancing using buffer management in distributed database environment

Distributed real time database processing is still one of the most typical problems in high data computing. Complex systems have to execute millions of data accesses in each and every hours with hundreds of thousands process to executes some tens of millions of data information. This paper has focus on process with a large number of processing instances, or servers, respectively. In this paper, we proposed a dynamic Load balancing algorithm used in distributed database environment. Our basic thinking is to provide a considerable request response time and transaction per unit time instead of distributing the all workload among all servers equally. Next, new algorithm is designed and evaluated using analytical models.

[1]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.

[2]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

[3]  Phillip Krueger,et al.  Adaptive Location Policies for Global Scheduling , 1994, IEEE Trans. Software Eng..

[4]  Phillip Krueger,et al.  Two adaptive location policies for global scheduling algorithms , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[5]  Anthony P. Reeves,et al.  Strategies for Dynamic Load Balancing on Highly Parallel Computers , 1993, IEEE Trans. Parallel Distributed Syst..

[6]  Donald F. Ferguson,et al.  Goal-oriented dynamic buffer pool management for data base systems , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[7]  Dong Li,et al.  A dynamic load balancing algorithm based on distributed database system , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[8]  Wesley W. Chu,et al.  Program behavior and the page-fault-frequency replacement algorithm , 1976, Computer.