Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks

✍ Scribed by M.A. Palis; S. Rajasekaran

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 995 KB
• Volume: 20
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.1994.1015

✦ Synopsis

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(\mathrm{D})) steps (where (\mathrm{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=n^{n}) 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. 1994 Academic Press. Inc.