Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing

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

Volumn 1284, Issue , 1997, Pages 284-295

  Iwama, Kazuo ^a   Miyano, Eiji ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

NETWORK OPERATIONS; OBLIVIOUS ROUTING; PERMUTATION ROUTING;

ARTIFICIAL INTELLIGENCE;

EID: 84949230059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_22     Document Type: Conference Paper

References (21)

1. A. Bar-Noy, P. Raghavan, B. Schieber and H, Tamaki, "Fast deflection routing for packets and worms," In Proc. ACM Symposium on Principles of Distributed Computing, 75-86 (1993).
2. A. Borodin and J.E. Hopcroft, "Routing, merging, and sorting on parallel models of computation," J. Computer and System Sciences 30 (1985) ISO-145.
3. S. Cheung and F.C.M. Lau, "A lower bound for permutation routing on two-dimensional bused meshes," Information Processing Letters 45 (1993) 225-228.
4. D.D. Chinn, T. Leighton and M. Tompa, "Minimal adaptive routing on the mesh with bounded queue size," In Proc. 1994 ACM Symp. on Parallel Algorithms and Architectures (1994) 354-363.
5. Q.P. Gu and J. Gu, "Two packet routing algorithms on a mesh-connected computer," IEEE Trans, on Parallel and Distributed Systems, Vol. 6, № 4 (1995) 436-440.
6. K. Iwama, E. Miyano and Y. Kambayashi, "Routing problems on the mesh of buses," J. Algorithms 20 (1996) 613-631.
7. K. Iwama and E. Miyano, "Oblivious routing algorithms on the mesh of buses," In Proc. 11th International Parallel Processing Symposium, (1997) 721-727.
8. C. Kaklamanis, D. Krizanc and A. Tsantilas, "Tight bounds for oblivious routing in the hypercube," Math. Systems Theory 24 (1991) 223-232.
9. C. Kaklamanis and D. Krizanc, "Optimal sorting on mesh-connected processor arrays," In Proc. 1991 ACM Symposium on Parallel Algorithms and Architectures, (1991) 17-28.
10. M. Kunde, "Lower bounds for sorting on mesh-connected architectures," Acta Informatica, 24 (1987) 121-130.
11. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann (1992).
12. F.T. Leighton, F. Makedon and I. Tollis, "A 2n - 2 step algorithm for routing in an nxn array with constant queue sizes," Algorithmica 14 (1995) 291-304.
13. L. Y.T. Leung and S.M. Shende, "Packet routing on square meshes with row and column buses," In Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures (1989) 328-335.
14. L. Y.T. Leung and S.M. Shende, "On multidimensional packet routing for meshes with buses," J. Parallel and Distributed Computing 20 (1994) 187-197.
15. T. Nesson, Randomized, oblivious, minimal routing algorithms for multicomputers, Ph.D Thesis, Harvard University (1995).
16. C.P. Schnorr and A. Shamir, "An optimal sorting algorithm for mesh-connected computers," In Proc. ACM Symp. on Theory of Computing, (1986) 255-263.
17. J.F. Sibeyn, M. Kaufmann and E. Raman, "Randomized routing on meshes with buses," In Proc. European Symposium on Algorithms, (1993) 333-344.
18. T. Suel, "Routing and sorting on fixed topologies," Ph.D Thesis, The University of Texas at Austin (1994).
19. S. Rajasekaran and R. Overholt, "Constant queue routing on a mesh," J. Parallel and Distributed Comput., 15 (1992) 160-166.
20. S. Rajasekaran and T. Tsantilas, "Optimal routing algorithms for mesh-connected processor arrays," Algorithmica 8 (1992) 21-38.
21. M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Department of Computer Science and Engineering, University of Washington (1994).