Multipacket routing on 2-D meshes and its application to fault-tolerant routing

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

Volumn 1643, Issue , 1999, Pages 53-64

  Iwama, Kazuo ^a   Miyano, Eiji ^b  

^a KYOTO UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MESH GENERATION;

CONSTANT SIZES; FAULT TOLERANT ROUTING; HIGH PROBABILITY; ITS APPLICATIONS; MESH ROUTING; RANDOMIZED ALGORITHMS; RUNNING TIME; TIME BOUND;

QUEUEING THEORY;

EID: 84958093162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_6     Document Type: Conference Paper

References (20)

1. A. Borodin and J.E. Hopcroft, “Routing, merging, and sorting on parallel models of computation,” J. Computer and System Sciences 30 (1985) 130-145.
2. A. Borodin, P. Raghavan, B. Schieber and E. Upfal, “How much can hardware help routing?,” In Proc. ACM Symposium on Theory of Computing (1993) 573-582.
3. M. Grammatikakis, D. Hsu, M. Kraetzl and J. Sibeyn, “Packet routing in fixed-connection networks: A survey,” manuscript (1998).
4. K. Iwama, Y. Kambayashi and E. Miyano, “New bounds for oblivious mesh routing,” In Proc. 6th European Symposium on Algorithms (1998) 295-306.
5. K. Iwama and E. Miyano, “An O(N) oblivious routing algorithms for 2-D meshes of constant queue-size,” In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (1999) 466-475.
6. C. Kaklamanis, D. Krizanc and A. Tsantilas, “Tight bounds for oblivious routing in the hypercube,” Mathematical Systems Theory 24 (1991) 223-232.
7. C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, A. Tsantilas, “Asymptotically tight bounds for computing with faulty arrays of processors,” In Proc. 31st Symposium on Foundations of Computer Science (1990) 285-296.
8. M. Kaufmann, J.F. Sibeyn, and T. Suel, “Derandomizing routing and sorting algorithms for meshes,” In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (1994) 669-679.
9. M. Kaufmann and J.F. Sibeyn, “Randomized multipacket routing and sorting on meshes,” Algorithmica, 17 (1997) 224-244.
10. M. Kunde and T. Tensi, “Multi-packet routing on mesh connected processor arrays,” In Proc. Symposium on Parallel Algorithms and Architectures (1989) 336-343.
11. M. Kunde, “Block gossiping on grids and tori: deterministic sorting and routing match the bisection bound,” In Proc. European Symposium on Algorithms (1993) 272-283.
12. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann (1992).
13. F.T. Leighton, F. Makedon and I. Tollis, “A 2n−2 step algorithm for routing in an n×n array with constant queue sizes,” Algorithmica 14 (1995) 291-304.
14. T.R. Mathies, “Percolation theory and computing with faulty arrays of processors,” In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms (1992) 100-103.
15. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press (1995).
16. P. Raghavan, “Robust algorithms for packet routing in a mesh,” Math. Systems Theory, 28 (1995) 1-11.
17. S. Rajasekaran and T. Tsantilas, “Optimal routing algorithms for mesh-connected processor arrays,” Algorithmica 8 (1992) 21-38.
18. S. Rajasekaran, “k-k routing, k-k sorting, and cut-through routing on the mesh,” J. Algorithms, 19, 3 (1995) 361-382.
19. J.F. Sibeyn, B.S. Chlebus and M. Kaufmann, “Deterministic permutation routing on meshes,” J. Algorithms 22 (1997) 111-141.
20. L.G. Valiant and G.J. Brebner, “Universal schemes for parallel communication,” In Proc. 13th Symposium on Theory of Computing (1981) 263-270.