A routing algorithm for PEC networks

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234891

C.C.S. Lin, V. K. Prasanna

引用次数: 5

Abstract

A routing algorithm is shown which can route in O( square root log N*2/sup square root 2logN/) steps in an N node packed exponential connections (PEC) network. It is also shown that semigroup operations can be performed in O(log N*2/sup square root 2logN/) parallel steps.<>

查看原文本刊更多论文

PEC网络的路由算法

给出了一种在N个节点的指数连接网络中以O(平方根logN *2/sup平方根2logN/)步完成路由的算法。还证明了半群运算可以在O(log N*2/sup平方根2logN/)个并行步骤中完成。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量