| 分布式系统中欺负算法及其优化 |
| |
| 引用本文： | 李晓婷,何博雄,钟联炯.分布式系统中欺负算法及其优化[J].西安工业学院学报,2004,24(3):210-213,221. |
| |
| 作者姓名： | 李晓婷 何博雄 钟联炯 |
| |
| 作者单位： | 西安工业学院计算机科学与工程学院 西安710032
(李晓婷，何博雄)，西安工业学院计算机科学与工程学院 西安710032(钟联炯) |
| |
| 摘 要： | 在介绍分布式系统欺负算法的基础上，对欺负算法由于传输大量信包以致性能较低的缺点进行详细分析，并抽象出数学模型．针对此问题，提出了一种优化算法并建立数学模型．通过对两种算法的比较分析，给出优化算法的优点：网络流量小、响应时间短、通信量最小化，并且避免了网络延迟和网络拥塞。
|
| 关 键 词： | 分布式系统 选举算法 欺负算法 协调者 |
| 文章编号： | 1000-5714(2004)03-0210-04 |
Bully algorithm and optimization in distributed systems |
| |
| LI Xiao-ting,HE Bo-xiong,ZHONG Lian-jiong.Bully algorithm and optimization in distributed systems[J].Journal of Xi'an Institute of Technology,2004,24(3):210-213,221. |
| |
| Authors: | LI Xiao-ting HE Bo-xiong ZHONG Lian-jiong |
| |
| Abstract: | 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. |
| |
| Keywords: | distributed system election algorithm bully algorithm coordinato |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
