Sharper analysis of packet routing on a butterfly

We present an algorithm that does packet routing on an N-node butterfly in time O(log N) with small constants. The algorithm is based on Ranade's probabilistic PRAM emulation. We simplify the algorithm by focusing on packet routing and prove bounds on its performance for the cases of permutation routing and uniform, random traffic. The main results are upper bounds on the probability that the routing time exceeds t for a fixed queue size. The simplifications made to Ranade's original algorithm and a more careful analysis enabled us to achieve better constants, which, to the best of our knowledge, are the best to date. © 1994 by John Wiley & Sons, Inc.

[1]  Arvind Krishna.  Communication with few buffers: analysis and design , 1991 .

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

[3]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

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

[5]  Jorge L. C. Sanz,et al.  A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines , 1990, ICPP.

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

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

[8]  Bruce E. Hajek,et al.  Performance of shuffle-like switching networks with deflection , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[9]  Eli Upfal,et al.  An O(logN) deterministic packet routing scheme , 1989, STOC '89.

[10]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

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

[12]  Alan Weiss,et al.  The Distribution of Waiting Times in Clocked Multistage Interconnection Networks , 1988, IEEE Trans. Computers.

[13]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[14]  Debasis Mitra,et al.  Randomized parallel communications on an extension of the omega network , 1987, JACM.

[15]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..