Deterministic Permutation Routing on Meshes

Journal of Algorithms

Volumn 22, Issue 1, 1997, Pages 111-141

  Sibeyn, Jop F ^a   Chlebus, Bogdan S ^b   Kaufmann, Michael ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040347757     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.0804     Document Type: Article

References (11)

1. B. S. Chlebus, M. Kaufmann, and J. F. Sibeyn, Deterministic permutation routing on meshes, in "Proceedings of the 5th Symposium on Parallel and Distributed Processing," IEEE Press, New York, pp. 814-821, 1993.
2. Q. P. Gu, and J. Gu, Two packet routing algorithms on a mesh-connected computer, in "Proceedings of the 4th Symposium on The Frontiers of Massively Parallel Computation," IEEE Press, New York, 1993.
3. M. Kaufmann, U. Meyer, and J. F. Sibeyn, Towards practical permutation routing on meshes, in Proceedings of the 6th Symposium on Parallel and Distributed Processing," IEEE Press, New York, pp. 664-671, 1994. Full version in Techn. Rep. MPI-I-94-153, Max-Planck Institut für Informatik, Saarbrücken, Germany, 1994.
4. M. Kunde, Routing and sorting on mesh connected processor arrays, "Proceedings, VLSI Algorithms and Architectures, Lecture Notes in Computer Science," Vol. 319, pp. 423-433, Springer-Verlag, Berlin/New York, 1988.
5. T. Leighton, F. Makedon, and Y. Tollis, A 2n - 2 step algorithm for routing in an n × n array with constant size queues, in "Proceedings of the Symposium on Parallel Algorithms and Architectures," pp. 328-335, Assoc. Comput. Mach., 1989.
6. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes," Morgan Kaufmann, San Mateo, CA, 1992.
7. S. Rajasekaran, and R. Overholt, Constant queue routing on a mesh, J. Parallel Distrib. Comput. 15 (1992), 160-166.
8. S. Rajasekaran, and Th. Tsantilas, Optimal routing algorithms for mesh-connected processor arrays, Algorithmica 8 (1992), 21-38.
9. C. P. Schnorr, and A. Shamir, An optimal sorting algorithm for mesh connected computers, in "Proceedings of the 18th Symposium on the Theory of Computing," pp. 255-263, Assoc. Comput. Mach., 1986.
10. J. F. Sibeyn, Desnakification of mesh sorting algorithms, in "Proceedings of the 2nd European Symposium on Algorithms, Lecture Notes in Computer Science," Vol. 855, pp. 377-390, 1994. Full version in Techn. Rep. MPI-I-94-102, Max-Planck Institut fur Informatik, Saarbrücken, Germany, 1994.
11. J. F. Sibeyn, B. S. Chlebus, and M. Kaufmann, Shorter queues for permutation routing on meshes, in "Proceedings of the 19th International Symposium Mathematical Foundations of Computer Science, Lecture Notes in Computer Science," Vol. 841, pp. 597-607, 1994.