Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Task assignment with unknown duration
Journal of the ACM (JACM)
EQUILOAD: a load balancing policy for clustered web servers
Performance Evaluation
Minimizing the Flow Time Without Migration
SIAM Journal on Computing
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
Dynamic Task Assignment in Server Farms: Better Performance by Task Grouping
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Task Assignment Strategy for Overloaded Systems
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Analysis of Task Assignment with Cycle Stealing under Central Queue
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A dynamic load distribution strategy for systems under high task variation and heavy traffic
Proceedings of the 2003 ACM symposium on Applied computing
Robust Processing Rate Allocation for Proportional Slowdown Differentiation on Internet Servers
IEEE Transactions on Computers
A least flow-time first load sharing approach for distributed server farm
Journal of Parallel and Distributed Computing
Deferred Assignment Scheduling in Cluster-Based Servers
Cluster Computing
Task assignment with work-conserving migration
Parallel Computing
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Scalable QoS Content-Aware Load Balancing Algorithm for a Web Switch Based on Classical Policies
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
Surprising results on task assignment in server farms with high-variability workloads
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Why segregating short jobs from long jobs under high variability is not always a win
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A scalable Multi-Tier Task Assignment Policy with Minimum Excess Load
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Task assignment based on prioritising traffic flows
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Journal of Parallel and Distributed Computing
Bandwidth-adaptive partitioning for distributed execution optimization of mobile applications
Journal of Network and Computer Applications
Hi-index | 0.00 |
Data intensive computing, in the Web environment, motivates the distributed designs of Web server systems (Web clusters) because of their scalability and cost-effectiveness instead of one Web server with high performance. The task assignment policy, in such systems, focuses on the manner of assigning the tasks that reach these systems (e.g. the case of intensive requests that reach the distributed Web server systems) in order to minimize the response time and thus, improve the performance. These tasks, generally, follow the ''heavy-tailed'' distribution which has the property that there is a tiny fraction (about 3%) of large tasks that makes half (50%) of the total load. Several policies were proposed in the literature to deal with the nature of this Web traffic. This paper presents a state-of-art of the existing task assignment policies. We classify these policies in two classes: policies which assume that the task size is known a priori, and policies which assume that the task size is not known a priori (like TAGS, TAPTF and TAPTF-WC). The first class of policies regroups policies which consider no knowledge of load information at the servers when assigning the incoming tasks, known as static policies (like Random, Round Robin, etc.) and, policies, known as dynamic policies (like Central Queue Policy, Least Loaded First ''LLF'', etc.) which use some load information (e.g. the processing capacity, the queue load, etc.) to process.