Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Heavy-tailed probability distributions in the World Wide Web
A practical guide to heavy tails
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Workload characterization of a Web proxy in a cable modem environment
ACM SIGMETRICS Performance Evaluation Review
Distributed systems (3rd ed.): concepts and design
Distributed systems (3rd ed.): concepts and design
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Scheduling Algorithms
Probability Models for Computer Science
Probability Models for Computer Science
EQUILOAD: a load balancing policy for clustered web servers
Performance Evaluation
Geist: A Web Traffic Generation Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
ADAPTLOAD: Effective Balancing in Custered Web Servers Under Transient Load Conditions
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Deferred Assignment Scheduling in Cluster-Based Servers
Cluster Computing
Multi-layered round robin routing for parallel servers
Queueing Systems: Theory and Applications
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A workload characterization study of the 1998 World Cup Web site
IEEE Network: The Magazine of Global Internetworking
Self-adaptive resource management for large-scale shared clusters
Journal of Computer Science and Technology
Adaptive Load Balancing Algorithm Based on Prediction Model in Cloud Computing
Proceedings of the Second International Conference on Innovative Computing and Cloud Computing
| Hi-index | 0.00 |
A cluster-based server consists of a front-end dispatcher and multiple back-end servers. The dispatcher receives incoming jobs, and then decides how to assign them to back-end servers, which in turn serve the jobs according to some discipline. Cluster-based servers have been widely deployed, as they combine good performance with low costs. Several assignment policies have been proposed for cluster-based servers, most of which aim to balance the load among back-end servers. There are two main strategies for load balancing: The first aims to balance the amount of workload at back-end servers, while the second aims to balance the number of jobs assigned to back-end servers. Examples of policies using these strategies are Dynamic and LC (Least Connected), respectively. In this paper we propose a policy, called LC*, which combines the two aforementioned strategies. The paper shows experimentally that when preemption is admitted (i.e., when jobs execute concurrently on back-end servers), LC* substantially outperforms bothDynamic and LC in terms of response-time metrics. This improved performance is achieved by using only information readily available to the dispatcher, rendering LC* a practical policy to implement. Finally, we study a refinement, called ALC* (Adaptive LC*), which further improves on the response-time performance of LC* by adapting its actions to incoming traffic rates.