Abstract
An active area of research regarding parallel computer systems deals with the design of interconnection networks. Among all interconnection networks, permutation networks play a special role as all other networks can be constructed using such networks. It was recently shown that many permutation networks reported in the literature are manifestations of coset decompositions of symmetric groups. This result is generalized here to obtain several other previously unknown permutation networks which satisfy such decompositions. In addition, analyses of the edge-count, propagation delay, fan-out, and setup time of such networks are provided. The results lead to some anomolous behavior as well as several trade-offs among these parameters. For example, it is shown that a complete bipartite graph is the fastest and most economical direct realization of a permutation network. Furthermore, it is shown that the fan-out of a network is inversely proportional to the propagation delay whereas the setup time may or may not relate to the propagation delay at all depending on the network in question. Finally, two constant fan-out implementations of these networks using O (n 1.59) 2 × 1 multiplexers and 2 × 2 switches are presented.
Similar content being viewed by others
References
Bandyopadhyay, S., Basu, S., and Choudhury, K. 1972. A cellular permuter array. IEEE Trans. Comp., C-21, 10 (Oct.), 1116–1119.
Benes, V.E. 1965. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York.
Clos, C. 1953. A study of non-blocking switching networks. BSTJ, 32, 1 (Feb.), 406–425.
Feng, T. 1981. A survey of interconnection networks. Computer, 14, 12 (Dec.), 12–27.
Gecsei, J. 1977. Interconnection networks from three-state cells. IEEE Trans. Comp., C-26, 8 (Aug.), 705–711.
Joel, A. 1968. On permutation switching networks. BSTJ, 47, 2 (May–June), 813–822.
Kautz, W.H., Levitt, K.N., and Waksman, A. 1968. Cellular interconnection arrays. IEEE Trans. Comp., C-17, 5 (May), 443–451.
Lawrie, D.K. 1975. Access and alignment of data in an array processor. IEEE Trans. Comp., C-24, 12 (Dec.), 1145–1155.
Masson, G.M., Gingher, G.C., and Nakamura, S. 1979. A sampler of circuit switching networks. Computer, 12, 6 (June), 32–48.
Oruç, A.Y. 1987. Designing cellular permutation networks through coset decomposition of symmetric groups. Journal of Parallel and Distributed Computing, 3, 3 (Aug.), 402–422.
Oruç, A.Y., and Oruç, M.Y. 1987. Programming cellular permutation networks through coset decomposition of symmetric groups. IEEE Trans. Comp., C-36, 7 (July), 802–809.
Oruç, A.Y., and Thirumalai, A. 1987. New cellular permutation networks for parallel communications. In Conference Proceedings — The 21st Conference on Information and Systems Sciences (Johns Hopkins University, Baltimore, Mar. 25–27), pp. 465–471.
Parker, D.S. 1980. Notes on shuffle-exchange type switching networks. IEEE Trans. Comp., C-29, 3 (Mar.), 213–222.
Pease, M.C. 1977. The indirect binary n-cube. IEEE Trans. Comp., C-26, 5 (May), 443–473.
Siegel, H.J. 1985. Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. Lexington Books, D.C. Heath and Company, Lexington, Mass.
Siegel, H.J., Tsun-Yuk Hsu, W., and Jeng, M. 1987. An introduction to the multistage cube family of interconnection networks. The Journal of Supercomputing, 1, (1) (Jan.), 13–42.
Thompson, C.D. 1978. Generalized connection networks for parallel processor intercommunication. IEEE Trans. Comp., C-27, 12 (Dec.), 1119–1125.
Thurber, K.J. 1978. Circuit switching technology: A state of the art survey. In Conference Proceedings—The Compcon 1978 Fall Conference (Sept. 1978), pp. 116–124.
Waksman, A. 1968. A permutation network. JACM, 15, 1 (Jan.), 159–163.
Author information
Authors and Affiliations
Additional information
This work is supported in part by the National Science Foundation under Grant No: CCR-8708864.
Rights and permissions
About this article
Cite this article
Oruç, A.Y., Schneider, S. Coset networks as connectors in parallel processors. J Supercomput 3, 21–39 (1989). https://doi.org/10.1007/BF00129646
Issue Date:
DOI: https://doi.org/10.1007/BF00129646