A least flow-time first load sharing approach for distributed server farm

Tari, Z, Broberg, J, Zomaya, A and Baldoni, R 2005, 'A least flow-time first load sharing approach for distributed server farm', Journal of Parallel and Distributed Computing, vol. 65, pp. 832-842.


Document type: Journal Article
Collection: Journal Articles

Title A least flow-time first load sharing approach for distributed server farm
Author(s) Tari, Z
Broberg, J
Zomaya, A
Baldoni, R
Year 2005
Journal name Journal of Parallel and Distributed Computing
Volume number 65
Start page 832
End page 842
Total pages 10
Publisher Academic Press
Abstract The most critical property exhibited by a heavy-tailed workload distribution (found in many WWW workloads) is that a very small fraction of tasks make up a large fraction of the workload, making the load very difficult to distribute in a distributed system. Load balancing and load sharing are the two predominant load distribution strategies used in such systems. Load sharing generally has better response time than load balancing because the latter can exhibit excessive overheads in selecting servers and partitioning tasks. We therefore further explored the least-loaded-first (LLF) load sharing approach and found two important limitations: (a) LLF does not consider the order of processing, and (b) when it assigns a task, LLF does not consider the processing capacity of servers. The high task size variation that exists in heavy-tailed workloads often causes smaller tasks to be severely delayed by large tasks. This paper proposes a size-based approach, called the least flow-time first (LFF-SIZE), which reduces the delay caused by size variation while maintaining a balanced load in the system. LFF-SIZE takes the relative processing time of a task into account and dynamically assigns a task to the fittest server with a lighter load and higher processing capacity. LFF-SIZE also uses a multi-section queue to separate larger tasks from smaller ones. This arrangement effectively reduces the delay of smaller tasks by larger ones as small tasks are given a higher priority to be processed. The performance results performed on the LFF-SIZE implementation shows a substantial improvement over existing load sharing and static size-based approaches under realistic heavy-tailed workloads.
Subject Computer Communications Networks
Keyword(s) scheduling policies
task assignment
heavy-tailed workloads
load balancing
load sharing
DOI - identifier 10.1016/j.jpdc.2005.02.007
Copyright notice Copyright © 2005 Elsevier Inc. All rights reserved.
ISSN 0743-7315
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 12 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 20 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 760 Abstract Views  -  Detailed Statistics
Created: Wed, 18 Feb 2009, 09:53:18 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us