OPTIMAL-ALGORITHMS FOR MULTIPACKET ROUTING-PROBLEMS ON RINGS

被引：2
|
作者：
MAKEDON, F [1 ]
SYMVONIS, A [1 ]
机构：
[1] UNIV SYDNEY,BASSER DEPT COMP SCI,SYDNEY,NSW 2006,AUSTRALIA
来源：
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1994年 / 22卷 / 01期
关键词：
D O I：
10.1006/jpdc.1994.1068
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study multipacket routing problems on rings of processors. We prove a new lower bound of 2n/3 routing steps for the case that k, the number of packets per processor, is at most 2. We also give an algorithm that tightens this lower bound. For the case where k > 2, the lower bound is kn/4. The trivial algorithm needs in the worst case k[n/2] steps to terminate. An algorithm that completes the routing in kn/4 + 2.5n routing steps is given. (C) 1994 Academic Press, Inc.
引用
收藏
页码：37 / 43
页数：7
相关论文
共 50 条
12345