用户名: 密码: 验证码:
一种适应性的动态负载平衡模型
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:An Adaptive Dynamic Load Balancing Model
  • 作者:赵廷磊 ; 乔建忠 ; 林树宽 ; 王彦华
  • 英文作者:ZHAO Ting-lei;QIAO Jian-zhong;LIN Shu-kuan;WANG Yan-hua;School of Computer Science & Engineering,Northeastern University;
  • 关键词:负载迁移 ; 节点状态 ; 脉冲切换系统 ; 动态负载平衡 ; 分布式系统
  • 英文关键词:load migration;;node state;;impulsive and switching system;;dynamic load balancing;;distributed system
  • 中文刊名:DBDX
  • 英文刊名:Journal of Northeastern University(Natural Science)
  • 机构:东北大学计算机科学与工程学院;
  • 出版日期:2019-06-15
  • 出版单位:东北大学学报(自然科学版)
  • 年:2019
  • 期:v.40;No.345
  • 基金:国家自然科学基金资助项目(61402442);; 辽宁省软件系统开发与应用重点实验室项目
  • 语种:中文;
  • 页:DBDX201906010
  • 页数:6
  • CN:06
  • ISSN:21-1344/T
  • 分类号:56-61
摘要
为了改善分布式系统中负载分布不平衡对性能的影响,提出并实现了一个基于控制理论的时滞脉冲切换负载平衡模型.该模型根据节点资源的动态性建立了相关子系统.当节点状态发生改变时触发子系统的切换,并根据负载迁移规则对过量负载进行迁移,迁移比例根据节点的实时运行状态进行计算.节点仅在此时才进行信息广播,降低了通信开销,提升了动态负载平衡的效率.给出了相应的负载平衡算法,并在实际平台上进行了验证.实验结果表明,与其他负载平衡算法相比,本模型算法使负载平衡时间平均减少29. 82%.
        To improve the distributed system performance which is affected by load unbalance,this paper proposes and implements an impulsive and switching load balancing model with time delay based on control theory. The model constructs the corresponding sub-system according to the dynamics of node resources. The overloading is migrated by the load migrate rule,of which the migrate proportion is calculated by real-time running states of nodes. Only on this moment,the node broadcasts its message to others. Thus,the communication cost among nodes decreases,and the efficiency of dynamic load balancing increases. This paper provides the corresponding load balancing algorithm and conducts the evaluation on a real platform. Experimental results demonstrate that compared with other load balancing algorithms,the load balancing time of the proposed model is reduced by 29. 82% on average.
引文
[1] Meng Q Y,Qiao J Z,Lin S K,et al. A delay-based dynamic load balancing method and its stability analysis and simulation[C]//Proceedings of European Conference on Parallel Computing. Ischia, 2010:192-203.
    [2] Shah R,Veeravalli B,Misra M. On the design of adaptive and decentralized load-balancing algorithms with load estimation for computational grid environments[J]. IEEE Transactions on Parallel and Distributed Systems,2007,18(12):1675-1686.
    [3] Xu J,Lam A,Li V. Chemical reaction optimization for task scheduling in grid computing[J]. IEEE Transactions on Parallel and Distributed Systems,2011,22(10):1624-1631.
    [4] Jiang Y C,Zhou Y F,Li Y P. Reliable task allocation with load balancing in multiplex networks[J]. ACM Transactions on Autonomous and Adaptive Systems, 2015,10(1):1-32.
    [5] Kang Q M,He H,We J. An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems[J]. Journal of Parallel and Distributed Computing,2013, 73(8):1106-1115.
    [6] Faragardi H R,Shojaee R,Keshtkar M A,et al. Optimal task allocation for maximizing reliability in distributed real-time systems[C]//Proceedings of the IEEE/ACIS 12th International Conference on Computer and Information Science. Niigata, 2013:513-519.
    [7] Subrata R,Zomaya A,Landfeldt B. Game-theoretic approach for load balancing in computational grids[J]. IEEE Transactions on Parallel and Distributed Systems,2008,19(1):66-76.
    [8] Bajaj R,Agrawal D. Improving scheduling of tasks in a heterogeneous environment[J]. IEEE Transactions on Parallel and Distributed Systems,2004,15(2):107-118.
    [9] Jiang Y C,Li Z F. Locality-sensitive task allocation and load balancing in networked multiagent systems:talent versus centrality[J]. Journal of Parallel and Distributed Computing,2011, 71(6):822-836.
    [10] Jiang Y C,Zhou Y F,Wang W Y. Task allocation for undependable multiagent systems in social networks[J]. IEEE Transactions on Parallel and Distributed Systems,2013,24(8):1671-1681.
    [11] Kumar R,Sahoo G. Cloud computing simulation using CloudSim[J]. International Journal of Engineering Trends and Technology,2014,8(2):82-86.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700