Efficient randomized routing algorithms on the two-dimensional mesh of buses

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

Volumn 1449, Issue , 1998, Pages 229-240

  Iwama, Kazuo ^a   Miyano, Eiji ^b   Tajima, Satoshi ^c   Tamaki, Hisao ^d  

^a KYOTO UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c TOSHIBA CORPORATION   (Japan)

^d MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; INFORMATION THEORY; MESH GENERATION; ROUTING ALGORITHMS;

HIGH PROBABILITY; INFORMATION-THEORETIC LOWER BOUNDS; LOCAL COMPUTATION; LOCAL CONNECTIONS; PARALLEL COMPUTATION MODEL; RANDOMIZED ALGORITHMS; RANDOMIZED ROUTING; UPPER BOUND;

BUSES;

EID: 84949009019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_27     Document Type: Conference Paper

References (13)

1. Che52. H. Chernoff, "A Measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Annals of Mathematical Statistics, 23 (1952) 493-507. 234.
2. CL93. S. Cheung and F. C. M. Lau, "A lower bound for permutation routing on twodimensional bused meshes," Information Processing Letters, 45 (1993) 225-228. 230.
3. CLT96. D. D. Chinn, T. Leighton and M. Tompa, "Minimal adaptive routing on the meshw ith bounded queue size," J. Parallel and Distributed Computing 34 (1996) 154-170. 230.
4. IMK96. K. Iwama, E. Miyano, and Y. Kambayashi, "Routing problems on the mesh of buses," J. Algorithms, 20 (1996) 613-631. 230, 239.
5. IM97a. K. Iwama and E. Miyano, "Oblivious routing algorithms on the mesh of buses," In Proc. International Parallel Processing Symposium (1997) 721-727. 230.
6. IM97b. K. Iwama and E. Miyano, "Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing," In Proc. European Symposium on Algorithms (1997) 154-170. 230.
7. Jof74. A. Joffe, "On a set of almost deterministic k-independent random variables," The Annals of Probability, Vol. 2 (1974) 161-162. 236.
8. Kri91. D. Krizanc, "Oblivious routing withlimit ed buffer capacity," J. Computer and System Sciences, 43 (1991) 317-327. 230.
9. Lei92. F. T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann (1992). 229.
10. LS94. 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. 230.
11. MS96. R. Miller and Q. F. Stout, Parallel algorithms for regular architectures: meshes and pyramids, The MIT Press (1996). 229.
12. MR95. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press (1995). 235, 238.
13. Tom94. M. Tompa, Lecture notes on message routing in parallel machines, Technical Report # 94-06-05, Department of Computer Science & Engineering, University of Washington (1994). 229.