基于欺负算法的改进选举算法  

Improved election algorithm based on bully algorithm

作　　者：熊超[1] 武小年[1,2] 张昭[1] 

机构地区：[1]桂林电子科技大学信息与通信学院,广西桂林541004 [2]保密通信重点实验室,四川成都610041

出　　处：《计算机工程与设计》2012年第12期4432-4435,4444,共5页Computer Engineering and Design

基　　金：保密通信重点实验室基金项目;广西教育厅基金项目(201010LX156;CD10066X);广西研究生教育创新计划基金项目(2010105950810M18)

摘　　要：欺负算法产生大量通信信息,时间开销大,占用系统资源过高,严重影响了分布式OLAP系统的性能。针对该问题,提出一种基于欺负算法的改进算法。该算法采用一对一的方式直接向性能最优的节点发送选举消息,以降低选举过程中产生信息的通信量和选举时间开销;并通过循环选举保证选举出系统的最优节点担任系统协调者。实验结果表明,该改进算法有效地降低了消息通信量,减少了时间开销,能更好的应用于分布式OLAP系统。Bully election algorithm has the high traffic complexity, generates a large number of messages, and takes up system resources. It affects the performance of distributed OLAP system. To address the problem, an optimized election algorithm based on the bully algorithm is proposed. The algorithm directly sends election messages to nodes with the optimal performance by one-to-one. And the optimal node is elected to act as the system coordinator by circular election. The tested results show that the improved election algorithm can reduce the messages and the time overhead effectively, and can be applied in distributed OLAP system well.

关 键 词：选举算法 欺负算法 分布式 联机分析处理 协调者 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]