This is a preview of subscription content, log in via an institution.
References
F. Annexstein and M. Blaumslag, A Unified Approach to Off-Line Permutation Routing on Parallel Networks, Symp. on Parallel Algorithms and Architectures, 1990, pp. 398–406.
T. Leighton, C. E. Leiserson, B. Maggs, S. Plotkin and J. Wein, Lecture Notes for Theory of Parallel and VLSI Computation, MIT/LCS/Research Seminar Series 1, 1988.
T. Leighton, F. Makedon and I. Tollis, A 2n–2 Step Algorithm for Routing in an n × n Array with Constant Size Queues, Symp. on Parallel Algorithms and Architectures, 1989, pp. 328–335.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krizanc, D. (1991). A note on off-line permutation routing on a mesh-connected processor array. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_190
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_190
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive