A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm

Load balancing is an important stage of a system using parallel computing where the aim is the balance of workload among all processors of the system. In this paper, we introduce a new load balancing algorithm with new capabilities for parallel systems, among which is the independence of a separate...

Full description

Saved in:
Bibliographic Details
Published inFrontiers of information technology & electronic engineering Vol. 12; no. 6; pp. 455 - 463
Main Authors Sadjady, Razieh Sadat, Zamanifar, Kamran
Format Journal Article
LanguageEnglish
Published Heidelberg SP Zhejiang University Press 01.06.2011
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1869-1951
2095-9184
1869-196X
2095-9230
DOI10.1631/jzus.C1000211

Cover

More Information
Summary:Load balancing is an important stage of a system using parallel computing where the aim is the balance of workload among all processors of the system. In this paper, we introduce a new load balancing algorithm with new capabilities for parallel systems, among which is the independence of a separate route-finder algorithm between the load receiver and sender nodes. In addition to simulation of the new algorithm, due to similarity in behavior to the proposed algorithm, the central algorithm is simulated. Simulation results show that, the system performance increases with the increase of the degree of neighborhood be- tween the processors. These results also indicate the algorithm's high compatibility with environment changes.
Bibliography:Parallel computing, Load balancing, Distributed system
Load balancing is an important stage of a system using parallel computing where the aim is the balance of workload among all processors of the system. In this paper, we introduce a new load balancing algorithm with new capabilities for parallel systems, among which is the independence of a separate route-finder algorithm between the load receiver and sender nodes. In addition to simulation of the new algorithm, due to similarity in behavior to the proposed algorithm, the central algorithm is simulated. Simulation results show that, the system performance increases with the increase of the degree of neighborhood be- tween the processors. These results also indicate the algorithm's high compatibility with environment changes.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1869-1951
2095-9184
1869-196X
2095-9230
DOI:10.1631/jzus.C1000211