分块无源星型光网络中的路由置换
Routing Permutations in Partitioned Optical Passive Star Networks
摘要:
它表明,一个POPS网络与g组和d个处理器,每组可以有效地路由n=dg处理器之间的任何置换。所使用的时隙的数量在最坏情况下是最优的,并且对于所有排列p至多是最优的两倍,使得对于所有i,p(i)<>i。
英文摘要:
It is shown that a POPS network with g groups and d processors per group can efficiently route any permutation among the n=dg processors. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations p such that p(i)<>i for all i.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。