Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Design and Evaluation of Effective Load Sharing in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
A Practical Approach to Dynamic Load Balancing
IEEE Transactions on Parallel and Distributed Systems
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 with Unknown Duration
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Review: Task assignment policies in distributed server systems: A survey
Journal of Network and Computer Applications
Distributed oblivious load balancing using prioritized job replication
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
Several approaches have been proposed to deal with the issue of load distribution, however they all have similar limitations, such as: (i) tasks are executed in an arbitrary order (which may cause large tasks to be delayed), (ii) the task dispatcher does not take into consideration the server processing capacity (which may cause a large task to be assigned to a server with low processing power) or (iii) they do not consider task deadlines (which if not met, may cause task starvation). This paper proposes an extension of LFF (Least Flow-time First) task assignment policy [9], called LFF-PRIORITY, to deal with these limitations. LFF-PRIORITY dynamically computes two priorities, namely task size and task size priorities, and put them in a priority based multi-section queue. The testing results clearly show that LFF-PRIORITY out performs existing load distribution strategies (that are based on heavy tailed distribution). The testing results also show that more than 80% of tasks meet their task deadline under LFF-PRIORITY.