Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks

We consider the problem of permutation routing on a star graph, an interconnection network which has better properties than the hypercube. In particular, its degree and diameter are sublogarithmic in the network size. We present optimal randomized routing algorithms that run in O(D) steps (where D is the network diameter) for the worst-case input with high probability. We also show that for the n-way shuffle network with N = nn nodes, there exists a randomized routing algorithm which runs in O(n) time with high probability. Another contribution of this paper is a universal randomized routing algorithm that could do optimal routing for a large class of networks (called leveled networks) which includes the star graph. The associative analysis is also network-independent. In addition, we present a deterministic routing algorithm, for the star graph, which is near optimal. All the algorithms we give are oblivious. As an application of our routing algorithms, we also show how to emulate a PRAM optimally on this class of networks.

[1]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[2]  Sanguthevar Rajasekaran,et al.  Optimal routing algorithms for mesh-connected processor arrays , 1988, Algorithmica.

[3]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  Sanguthevar Rajasekaran,et al.  Optimal randomized algorithms for multipacket and cut through routing on the mesh , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[5]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[6]  Romas Aleliunas,et al.  Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[7]  David Shyue Liang Wei.  Fast parallel routing and computation on interconnection networks , 1991 .

[8]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[9]  Sanguthevar Rajasekaran,et al.  General Routing Algorithms for Star Graphs , 1989 .

[10]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[11]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[12]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[13]  Sanguthevar Rajasekaran,et al.  An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks , 1987, FSTTCS.

[14]  Sanguthevar Rajasekaran,et al.  Emulation of a PRAM on Leveled Networks , 1991, ICPP.

[15]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[16]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[17]  Sanguthevar Rajasekaran,et al.  Constant Queue Routing on a Mesh , 1991, STACS.

[18]  Debasis Mitra,et al.  Randomized Parallel Communications , 1986, ICPP.

[19]  Fillia Makedon,et al.  A 2n−2 step algorithm for routing in ann ×n array with constant-size queues , 1995, SPAA '89.

[20]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[21]  Sanguthevar Rajasekaran,et al.  Randomised algorithms for packet routing on the mesh , 1992 .

[22]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

[23]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[24]  Fillia Makedon,et al.  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.

[25]  Manfred Kunde.  Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[26]  Lawrence Snyder,et al.  Type architectures, shared memory, and the corollary of modest potential , 1986 .

[27]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[28]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..