Traveling token for dynamic load balancing

被引:0
作者
Omari, T [1 ]
Hosseini, SH [1 ]
Vairavan, K [1 ]
机构
[1] Carleton Univ, Dept Syst & Comp Engn, Ottawa, ON K1S 5B6, Canada
来源
THIRD IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS | 2004年
关键词
D O I
10.1109/NCA.2004.1347795
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Load distribution improves performance of a computer network by transferring tasks from heavily loaded computers, where service is poor, to lightly loaded computers, where the tasks can take advantage Of an available computing capacity that would otherwise go unused. In this paper, a traveling token concept for dynamic load balancing protocol is proposed. Instead of each computer probing other computers often resulting in unsuccessful probing, we take a different approach that makes the identity of the heavily loaded and lightly loaded computers better known to other computers. The results of our simulation show that the proposed protocol outperforms other existing protocols implemented in our simulator almost in all cases we tested.
引用
收藏
页码:329 / 332
页数:4
相关论文
共 12 条
[1]  
Bevilacqua A., 1999, Informatica, V23, P49
[2]   A TAXONOMY OF SCHEDULING IN GENERAL-PURPOSE DISTRIBUTED COMPUTING SYSTEMS [J].
CASAVANT, TL ;
KUHL, JG .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (02) :141-154
[3]  
FENG Y, 2000, HIGH PERF COMP 2000, V2, P949
[4]  
Ferrari D, 1987, P PERF 87 12 INT S C, P515
[5]  
Joshi B. S., 1993, Proceedings the 2nd International Symposium on High Performance Distributed Computing (Cat. No.93TH0550-4), P216, DOI 10.1109/HPDC.1993.263839
[6]  
KREMIEN O, 1992, IEEE T PARALLEL DIST, V3
[7]  
KRUEGER P, 1992, COMPUTER, P33
[8]  
PULIDAS S, P IEEE 8 INT C DISTR
[9]   THE PROBABILITY OF LOAD BALANCING SUCCESS IN A HOMOGENEOUS NETWORK [J].
ROMMEL, CG .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (09) :922-933
[10]  
Shirazi Behrooz A., 1995, SCHEDULING LOAD BALA