On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

The sizes of permutation networks for special sets of permutations are investigated. The study of the planar realization and the search for small but hard sets of permutations are also included. Several asymptotically optimal estimations for distinct subsets of the set of all permutations are established here.

[1]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[2]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[3]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[4]  V. Benes.  Permutation groups, complexes, and rearrangeable connecting networks , 1964 .

[5]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[6]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[7]  Juraj Hromkovic,et al.  Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs , 1993, Inf. Comput..

[8]  Ralf Klasing.  The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width , 1994, MFCS.

[9]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[10]  Frank Thomson Leighton,et al.  A Tight Lower Bound on the Size of Planar Permutation Networks , 1992, SIAM J. Discret. Math..

[11]  Juraj Hromkovic,et al.  Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs , 1993, ESA.

[12]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

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

[14]  Miroslaw Kutylowski,et al.  Fast and feasible periodic sorting networks of constant depth , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[15]  Juraj Hromkovic,et al.  Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes , 1997, Inf. Comput..

[16]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[17]  David Bruce Wilson.  Embedding leveled hypercube algorithms into hypercubes (extended abstract) , 1992, SPAA '92.

[18]  Juraj Hromkovic,et al.  Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks , 1993, WG.

[19]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

[20]  Juraj Hromkovic,et al.  Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract) , 1994, SWAT.

[21]  Leslie G. Valiant,et al.  Shifting Graphs and Their Applications , 1976, J. ACM.