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

Sadat SADJADY; Kamran ZAMANIFAR

doi:10.1631/jzus.C1000211

Your Location：

Home >

Browse articles >

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

计算机与自动化 | Updated：2022-08-31

- A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm
- A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm
- 信息与电子工程前沿（英文） 2011年12卷第6期页码：455-463
- Affiliations：
  
  Department of Computer Engineering, Islamic Azad University, Najafabad Branch, Isfahan, Iran
- Author bio：
  
  E-mail:rsadjady@gmail.com
  zamanifar@eng.ui.ac.ir
- Funds：
- DOI：10.1631/jzus.C1000211
  中图分类号：
- 收稿：2010-06-21，
  
  修回：2011-03-31，
  
  录用：2010-11-12，
  
  纸质出版：2011-06
- Accepted：
Scan QR Code
A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm[J]. 信息与电子工程前沿（英文）, 2011,12(6):455-463.

Sadat SADJADY, Kamran ZAMANIFAR. A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(6): 455-463.
A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm[J]. 信息与电子工程前沿（英文）, 2011,12(6):455-463. DOI： 10.1631/jzus.C1000211.

Sadat SADJADY, Kamran ZAMANIFAR. A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(6): 455-463. DOI： 10.1631/jzus.C1000211.

摘要

Abstract

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 between the processors. These results also indicate the algorithm’s high compatibility with environment changes.

关键词

Keywords

references

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

Asymmetry-aware load balancing for parallel applications in single-ISA multi-core systems

Task mapper and application-aware virtual machine scheduler oriented for parallel computing

相关机构

School of Computer Science and Engineering, Seoul National University

School of Computer Science and Engineering, Xi'an University of Technology

State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University

Department of Electronic Science & Technology, Huazhong University of Science and Technology

National Research Center of Parallel Computer Engineering and Technology

Chat

地址：浙江杭州天目山路148号，浙江大学出版社邮编：310028
联系电话：+86-571-88273162 Email：fitee@zju.edu.cn
本系统建议在Chrome、 IE9+ 以上版本浏览器阅读本站内容，360浏览器请切换至极速模式
Cookies帮助我们提供服务并提供个性化体验。使用本网站，即表示您同意我们使用Cookies

⁰