A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network

被引：0

作者：

Paduraru, Ciprian. I. ^{[1
]}

机构：

[1] Univ Bucharest, Dept Comp Sci, Bucharest, Romania

来源：

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS | 2014年 / 5卷 / 02期

关键词：

scheduling; greedy; coordination; network;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

One of the most challenging issues when dealing with distributed networks is the efficiency of jobs load balancing. This paper presents a novel algorithm for load balancing jobs that have a given deadline in a distributed network assuming central coordination. The algorithm uses a greedy strategy for global and local decision making: schedule a job as late as possible. It has an increased overhead over other well-known methods, but the load balancing policy provides a better fit for jobs.

引用

页码：56 / 59

页数：4