Affiliation:
1. IBM Almaden Research Center, San Jose, CA; and Weizmann Institute of Science, Rehovot, Israel
Abstract
A deterministic
O
(log
N
)-time algorithm for the problem of routing an aribitrary permutation on an
N
-processor bounded-degree network with bounded buffers is presented.
Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the sorting network of Ajtai, et al. [1]. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献