摘要
本文提出了一种双层多中心多目发送保序机制，并在以太网和工作站环境中实现．通过将本方法与现有集中式、分布式和树型方式的比较以及对实验数据的分析，认为集中式虽然通信开销低、简单易实现，但坚定性差、并行度低；分布式方式虽然坚定性强，但并行度低、通信开销大、效率低；传播树方式效率虽然较前两种有所提高，但在根结点处同样并行度低、坚定性差，而且结构不灵活．本文提出的方法，避免了上述三种方式的缺点，并且具有坚定性强、并行度高和结构灵活、简单的特点．
TIs paper proposes a mechanism of twe-layered multi-center multicast with ordering. This mechasm has been implemented on the workstations connected by the ethernet. We compare the performance of this model with three conventional methods: center-control model, distribute model and tree model. The analysis and esperiment results show that the center-coned model has the advantage of low communication cast and simple implementation, but has per robustness and low parallelism; the distribute model is robustness but has low parallelism and heavy communication cost, the tree model is more efficient than the above two models but it has lOw parallelism and poor robustness at the root node and a complex structure, the proposed method avoids the disadvantages of the three and has the advantages of robustness, high parallelism and simple structure.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1997年第11期109-112,共4页
Acta Electronica Sinica
基金
国家"863"项目
关键词
多目发送
保序机制
并行度
分布式
计算机系统
multicast with ordering, Two-layered multi-center model, Parallelism, Robustness
