Task assignment based on prioritising traffic flows

Authors:
James Broberg;Zahir Tari;Panlop Zeephongsekul
Affiliations:
RMIT University, VIC, Australia;RMIT University, VIC, Australia;RMIT University, VIC, Australia
Venue:
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Year:
2004

Citing 11
Cited 2

Exploiting process lifetime distributions for dynamic load balancing

ACM Transactions on Computer Systems (TOCS)
Self-similarity in World Wide Web traffic: evidence and possible causes

IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Task assignment in a distributed system (extended abstract): improving performance by unbalancing load

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
Task assignment with unknown duration

Journal of the ACM (JACM)
EQUILOAD: a load balancing policy for clustered web servers

Performance Evaluation
Analysis and characterization of large-scale Web server access patterns and performance

World Wide Web
Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness

HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Analysis of Task Assignment with Cycle Stealing under Central Queue

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A workload characterization study of the 1998 World Cup Web site

IEEE Network: The Magazine of Global Internetworking

Task assignment with work-conserving migration

Parallel Computing
Review: Task assignment policies in distributed server systems: A survey

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignment based on Prioritising Traffic Flows) is proposed, which improves performance under heavy-tailed workloads for certain classes of traffic. TAPTF controls the influx of tasks to each host, enables service differentiation through the use of dual queues and prevents large tasks from unduly delaying small tasks via task migration. Analytical results show that TAPTF performs significantly better than existing approaches, where task sizes are unknown and tasks are non-preemptive (run-to-completion). As system load increases, the scope and the magnitude of the performance gain expands, exhibiting improvements of more than six times in some cases.