摘要
在介绍分布式系统欺负算法的基础上 ,对欺负算法由于传输大量信包以致性能较低的缺点进行详细分析 ,并抽象出数学模型 .针对此问题 ,提出了一种优化算法并建立数学模型 .通过对两种算法的比较分析 ,给出优化算法的优点 :网络流量小、响应时间短、通信量最小化 。
On the basis of introduction to Bully algorithm in distributed systems,the disadvantages that the Bully algorithm transfers large numbers of messages and results in inferior performance were analyzed particularly,the mathematical model of the algorithm was built.To improve the Bully algorithm,an optimal algorithm was proposed and the relevant mathematical model was found.Compared with the Bully algorithm,the advantages of the new algorithm embodies many advantages in respect of less flux,quick response,minimum communication,avoidance of delay and congestion.
出处
《西安工业学院学报》
2004年第3期210-213,221,共5页
Journal of Xi'an Institute of Technology
关键词
分布式系统
选举算法
欺负算法
协调者
distributed system
election algorithm
bully algorithm
coordinato
