Abstract
In this paper, the rearrangeability of (2s—1)-stage networks is proved. This result is used to prove that (2 logn N—1)-stage nonsymmetric networks employing uniform connection pattern, two passes through s-stage networks with the same kth and (s—k+1)st stages, and 2 logn N—1 circulations through single-stage networks are rearrangeable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. H. Lawrie. Access and alignment of data in an array processor, IEEE Transactions on Computers, C-24(12), 1975, pp. 1145–1155.
C. Wu, T. Feng. On a class of multistage interconnection networks, IEEE Transactions on Computers, C-29(8), 1980, pp. 694–702.
L. R. Goke, G. J. Lipovski. Banyan networks for partitioning multiprocessor systems, in Proceedings of 1st annual symposium on computer architecture, 1973, pp. 21–28.
H. S. Stone. Parallel processing with perfect shuffle. IEEE Transactions on Computers, C-20(2), 1971, pp. 153–161.
A. Varma, C. S. Raghavendra. Interconnection Networks for Multiprocessors and Multicomputers. IEEE Computer Society Press, 1994.
D. S. Parker. Notes on shuffle/exchange type switching networks. IEEE Transactions on Computers, C-29(3), 1980, pp. 213–222.
C. L. Wu, T. H. Feng. The universality of shuffle/exchange network. IEEE Transactions on Computers, C-30(5), 1981, pp. 324–332.
C. K. Kotari, S. Lakshmivarahan. A note on rearrangeable networks. Technical report, School of Engineering and Computer Science, University of Oklahoma, 1983.
A. Varma, C. S. Rahavendra. Rearrangeability of multistage shuffle exchange networks. IEEE Transactions on Communications, 36(10), 1988, pp. 1138–1147.
N. Linital and M. Tarzi. Interpolation between bases and the shuffle exchange networks. European Journal of Combinatorics, 10, 1989, pp. 29–39.
F. Soviš. On rearrangeable networks of shuffle/exchange type. Computers and Artificial Intelligence, 7(4), 1988, pp. 359–373.
H. Cam, J. A. B. Fortes. Rearrangeability of shuffle/exchange networks, in Proceedings Frontiers of Massively Parallel Computation, 1990, pp. 303–314.
Frank K. Hwang. The mathematical theory of nonblocking switching networks networks. World Scientific, 1999.
R. Bashirov. On the rearrangeability of (2s-1)-stage nonsymmetric interconnection networks, in Proceedings 2000 International Conference on Parallel and Distributed Processing Techniques and Applications, June 2000, pp. 907–912.
V. E. Beneš. Mathematical theory of connecting networks and telephone traffic. New York, Academic Press, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bashirov, R. (2000). On the Rearrangeability of Multistage Networks Employing Uniform Connection Pattern. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2000. Lecture Notes in Computer Science, vol 1909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40888-6_16
Download citation
DOI: https://doi.org/10.1007/3-540-40888-6_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41184-0
Online ISBN: 978-3-540-40888-8
eBook Packages: Springer Book Archive