This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T-Y, Feng, “A Survey of Interconnection Networks”, IEEE Computer, Dec. 1981, pp. 12–27.
S. Abraham and K. Padmanabhan, “Performance of the Direct Binary n-Cube Network for Multiprocessors”, 1986 Int. Conf. on Parallel Processing, pp. 636–639.
G.M. Masson and G.C. Ginger and S. Makamura, “A Sampler of Circuit Switching Networks”, IEEE Computer, June 1979, pp. 32–48.
E. Choi, et al, “Hyperswitch Network for the Hypercube Computer”, Proc. Annu. Symp. Comput. Arch., 1988, pp. 90–99.
T. Szymanski, “On the Permutation Capability of a Circuit-switched Hypercube”, 1989 Int. Conf. on Parallel Processing, pp. I:103–110.
C.D. Thompson, “Generalized Connection Networks for Parallel Processor Intercommunication”, IEEE trans. Comput. Vol. C-27(12), Dec. 1978, pp. 1119–1125.
D. Nassimi and S. Sahni, “Optimal BPC permutations on a Cube Connected SIMD Computer”, IEEE Trans. Comput. Vol. C-31(4), Apr. 1982, pp. 338–341.
W. Lin, “A dimension-scrambling approach to fast hypercube data permutations”, 1990 Int. Conf. on parallel Processing, pp. III:119–122.
Z. Liu and J. You, “Realizing Frequently Used Permutations on Syncube”, 1991 Int. Conf. on parallel Processing, pp. I:274–277.
V.E. Benes, The Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.
S.E. Orcutt, “Implementation of Permutation in ILLIAC IV type Computer”, IEEE Trans. Comput. Vol. C-31(12), Dec. 1982, pp. 1202–1214.
A. Borodin, J.E. Hopcroft, “Routing, Merging and Sorting on Parallel Models of Computation”, Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 338–344.
W.J. Dally and C.L. Sietz, “Deadlock Free Message Routing in Multiprocessor Interconnection Networks”, IEEE Trans. Comput. Vol. C-36(5), May. 1987, pp. 547–553.
H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, McGraw-Hill, 1990.
K. Hwang and F.A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, 1984.
A. Lubiw, “A Couter-example to a Conjecture by Szymanski on Hypercube Routing”, Info. Proc. Lett. Vol. 35, June 1990, pp. 57–61.
X. Shen, Q. Hu, and W. Liang, “Realizability of an Arbitrary Permutation on a Circuit-Switched Hypercube,” to appear in Info. Proc. Lett.
Kai Hwang, Advanced Computer Architecture — Parallelism, Scalability, Programmability, McGraw-Hill, 1993.
S. Khuller, S.G. Mitchell and V.V. Vazirani, “Processor Efficient Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowaki Homeomorph”, SIAM J. Comput. Vol. 21, No. 3, June, 1992, pp. 486–506.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, X., Hu, Q., Dai, H., Wang, X. (1994). Optimal routing of permutations on rings. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_200
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_200
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive