By Topic

A dynamic load scheduling algorithm for Web servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chengcheng Guo ; Electron. Inf. Sch., Wuhan Univ., China ; Zhi Xiong ; Puliu Yan

As used increasingly the embedded objects and the database searching tasks in Web pages, there is larger difference among the loads of different server in a cluster system, it becomes more difficult for a heterogeneous Web server cluster to achieve high performance. In this paper, we present a dynamic algorithm on load scheduling, namely multiplicative decrease in critical area. For each of the servers in the cluster, the algorithm can more accurately evaluate the current load state by using the equivalent load-alternant and can more efficiently restrain the occurring of the reject service phenomenon by using a special MDC operator. Besides, we apply a method of random distributing base-probability to assign each request to an appropriate server in terms of their weight. All the parameters that will be used in our algorithm could be acquired by test. We also provide improved approximation results of our algorithm for the case where documents are consisted of relatively many embedded objects or database searches and lots of requests are arrived at the dispatcher synchronously.

Published in:

Computer and Information Technology, 2004. CIT '04. The Fourth International Conference on

Date of Conference:

14-16 Sept. 2004