Switching Networks: Recent Advances pp 191-214 | Cite as

# Periodic Shifting Networks

## Abstract

*A network* can be viewed as a graph, where each node corresponds to a processor and edges represent communication links between processors. Each processor can directly access only its private, local resources (e.g. memory). An exchange of information between processors is via paths of the graph. There is a variety of possible network architectures (graphs) but only some of them can be considered as practical. We usually demand that the degree of the network should be reasonably bounded and the communication traffic should be easy to control. On the other hand we wish that the network is able to realize at least typical communication tasks efficiently.

## Keywords

Output Node Constant Depth Switching Network Consecutive Layer Efficient Realization## Preview

Unable to display preview. Download preview PDF.

## References

- [1]M. Ajtai, J. Komlós, E. Szemeredi, Sorting in
*c*logn Parallel Steps,*Combinatorica*3 (1983) pp. 1–19.MathSciNetMATHCrossRefGoogle Scholar - [2]V. Beneš, Permutation Groups, Complexes, and Rearrangeable Multistage Connecting Networks,
*Bell System Tech. Journal*43 (1964) pp. 1619–1640.MATHGoogle Scholar - [3]V. Beneš,
*Mathematical Theory of Connecting Networks and Telephone Traffic*( Academic Press, New York, 1965 ).MATHGoogle Scholar - [4]R. Cole, B. Maggs, R. Sitaraman, Routing on Butterfly Networks with Random Faults,
*Proc. of the 36th Annual Symposium on Foundations of Computer Science*, (IEEE, 1995 ) pp. 558–570.Google Scholar - [5]J. Hromkovič, K. Loryś, P. Kanarek, R. Klasing, W. Unger, H. Wagener, On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks (extended abstract),
*Proc. of the 12th Symposium on Theoretical Aspects of Computer Science*(Springer-Verlag LNCS 900, 1995 ) pp. 255–266.Google Scholar - [6]J. Hromkovič, R. Klasing, W. Unger, H. Wagener, Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes,
*Proc. of the 4th Scandinavian Workshop on Algorithm Theory*(Springer-Verlag LNCS 824, 1994 ) pp. 219–230.Google Scholar - [7]P. Kanarek, K. Lory, Shallow Switching Networks for Special Families of Shifts,
*Tech. Rep. tr-ri-95–162*( University of Paderborn, June 1995 ).Google Scholar - [8]M. Kutylowski, K. Lorys, B. Oesterdiekhoff, Periodic Merging Networks,
*Proc. of the 7th ISAAC*, (Springer-Verlag LNCS 1178, 1996 ), pp. 336–345.MathSciNetGoogle Scholar - [9]M. Kutylowski, K. Lorys, B. Oesterdiekhoff, R. Wanka, Fast and Feasible Periodic Sorting Networks of Constant Depth,
*Proc. of the 35th Annual Symposium on Foundations of Computer Science*(IEEE 1994 ) pp. 369–380.Google Scholar - [10]F.T. Leighton,
*Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes*(Morgan Kaufmann Publisher, 1992).Google Scholar - [11]N. Pippenger, Self-routing Superconcentrators,
*Proc. of the 25th Annual ACM Symposium on the Theory of Computing*( ACM Press, New York, 1993 ) pp. 355–361.Google Scholar - [12]N. Pippenger, L. Valiant, Shifting Graphs and their Applications,
*J. of the ACM*23 (3) (1976) pp. 423–432.MathSciNetMATHCrossRefGoogle Scholar - [13]A. Waksman, A Permutation Network,
*J. of the ACM*Vol. 15 No. 1 (1968) pp. 159–163.MATHCrossRefGoogle Scholar - [14]R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern,
*Ph.D. Dissertation*(Universität Paderborn, 1994).Google Scholar - [15]E. Upfal, On the Theory of Interconnection Networks for Parallel Computers,
*Proc. of the 21st Annual International Colloquium on Automata, Languages and Programming*(Springer-Verlag LNCS 320, 1994 ) pp. 473–486.Google Scholar