Shorter queues for permutation routing on meshes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 841 LNCS, Issue , 1994, Pages 597-607

  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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUXILIARY MEMORY; DETERMINISTIC ALGORITHMS; NEAR-OPTIMAL; OPTIMAL TIME; PERMUTATION ROUTING; QUEUE LENGTHS; ROUTING PERMUTATION; ROUTING SCHEME;

QUEUEING THEORY;

EID: 21844497019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58338-6_106     Document Type: Conference Paper

References (6)

1. Chlebus, B.S., M. Kaufmann, J.F. Sibeyn, “Deterministic Permutation Routing on Meshes,” Proc. 5th Syrup. on Parallel and Distributed Proc., pp. 814-821, IEEE, 1993.
2. Kunde, M., “Routing and Sorting on Mesh Connected Processor Arrays,” Proc. VLSI Algorithms and Architectures, Lecture Notes in Computer Science 319, pp. 423-433, Springer-Verlag, 1988.
3. Leighton, T., F. Makedon, Y. Tollis, “A 2n - 2 Step Algorithm for Routing in an n x n Array with Constant Size Queues,” Proc. Symposium on Parallel Algorithms and Architectures, pp. 328-335, ACM, 1989.
4. Rajasekaran, S., R. Overholt, “Constant Queue Routing on a Mesh,” Journal of Parallel and Distributed Computing, pp. 160-166, 1992.
5. Rajasekaran, S., Th. Tsantilas, “Optimal Routing Algorithms for Mesh-Connected Processor Arrays,” Algorithmica 8, pp. 21-38, 1992.
6. Sibeyn, J.F., “Desnakifieation of Mesh Sorting Algorithms,” Teehn. Rep. MPI-Lgg-102, Max- Planek Institut fiir Informatik, Saarbriicken, Germany, submitted to ESA '94.