Affiliation:
1. Jilin University
2. China Unicom Research Institute
Abstract
Load balancing problems play a special role in the operation of parallel and distribution systems. The core technology of load balancing is the task scheduling. In order to achieve equally distribute the load on processors and maximize their utilities while minimizing the total task execution time, this article analyses a large number of data retrieval requests content. It shows different tasks have different resource occupation rate on the server node and the current server load is also different. The demand of different task types on CPU and I/O resources are not same. So, this paper presents a dynamic load balancing algorithm which is based on task classification, and applies it to the cluster system data retrieval.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. M. Kobayashi and K. Takeda, Information Retrieval on the Web, ACM Computing Surveys, vol. 32, no. 2, pp.143-172, June (2000).
2. Yung-Cheng Ma, Chung-Ping Chung, Tien-Fu Chen.: Load and storage balanced posting file partitioning for parallel information retrieval, The Journal of Systems and Software, vol. 84, p.864–884, (2011).
3. Wilkinson,B., Allen,M.: Parallel Programming Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice-Hall, Upper Saddle River, (1999).
4. Shirazi, A., Hurson, A., Kavi, M.: Scheduling and Load Balancing in Parallel Distributed Systems. Wiley-IEEE Computer Society Press, Los Alamitos, CA , (1995).
5. Nayer M. Wanas, Nadia H. Hegazi, Samir I. Shaheen, A Dynamic Load Balancing Framework for Real-time Applications in Message Passing Systems, Int. J. Parallel Prog. vol. 39, p.143–182, (2011).