Recent developments in mesh routing algorithms

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 3, 2000, Pages 530-540

  Iwama, Kazuo ^a,b   Miyano, Eiji ^b  

^a KYOTO UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER TERMINALS; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; TELECOMMUNICATION LINKS; TWO DIMENSIONAL;

MESH CONNECTED COMPUTER; MESH ROUTING ALGORITHM; PACKET ROUTING;

PARALLEL ALGORITHMS;

EID: 0034157021     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. S.G. Akl Parallel Computation: Models and Methods Prentice Hall 1997.
2. Y. Ben-Asher and I. Newman "Geometric approach for optimal routing on mesh with buses" Electronic Colloquium on Computational Complexity-Reports Series TR96-053 1996.
3. A. Borodin and J.E. Hopcroft "Routing merging and sorting on parallel models of computation" J. Computer and System Sciences vol.30 pp.130-145 1985.
4. A. Borodin P. Raghavan B. Schieber and E. Upfal "How much can hardware help routing?" Proc. ACM Symposium on Theory of Computing pp.573-582 1993.
5. S. Cheung and F.C.M. Lau "A lower bound for permutation routing on two-dimensional bused meshes" Information Processing Letters vol.45 pp.225-228 1993.
6. D.D. Chinn T. Leighton and M. Tompa "Minimal adaptive routing on the mesh with bounded queue size" J. Parallel & Distributed Computing vol.34 pp.154-170 1996.
7. K. Iwama E. Miyano and Y. Kambayashi "Routing problems on the mesh of buses" J. Algorithms vol.20 pp.613-631 1996.
8. K. Iwama and E. Miyano "Oblivious routing algorithms on the mesh of buses" Proc. International Parallel Processing Symposium pp.721-727 1997.
9. K. Iwama and E. Miyano "Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing" Proc. 5th European Symposium on Algorithms pp.284-295 1997.
10. K. Iwama Y. Kambayashi and E. Miyano "New bounds for oblivious mesh routing" Proc. 6th European Symposium on Algorithms pp.295-306 1998.
11. K. Iwama E. Miyano S. Tajima and H. Tamaki "Efficient randomized routing algorithms on the two-dimensional mesh of buses" Proc. International Computing and Combinatorics Conference pp.229-240 1998.
12. K. Iwama and E. Miyano "An O(√N) oblivious routing algorithms for 2-D meshes of constant queue-size" Proc. 10th ACM-SIAM Symposium on Discrete Algorithms pp.466-475 1999.
13. K. Iwama and E. Miyano "Multipacket routing on 2-D meshes and its application to fault-tolerant routing" Proc. 7th European Symposium on Algorithms pp.53-64 1999.
14. C. Kaklamanis D. Krizanc and A. Tsantilas "Tight bounds for oblivious routing in the hypercube" Mathematical Systems Theory vol.24 pp.223-232 1991.
15. C. Kaklamanis A.R. Karlin F.T. Leighton V. Milenkovic P. Raghavan S. Rao C. Thomborson and A. Tsantilas "Asymptotically tight bounds for computing with faulty arrays of processors" Proc. 31st Symposium on Foundations of Computer Science pp.285-296 1990.
16. C. Kaklamanis D. Krizanc and S. Rao "Simple path selection for optimal routing on processor arrays" Proc. Symposium on Parallel Algorithms and Architectures pp.23-30 1992.
17. M. Kaufmann J.F. Sibeyn and T. Sucl "Derandomizing routing and sorting algorithms for meshes" Proc. 5th ACM-SIAM Symposium on Discrete Algorithms pp.669-679 1994.
18. M. Kaufmann and J.F. Sibeyn "Randomized multipacket routing and sorting on meshes" Algorithmica vol.17 pp.224-244 1997.
19. M. Kaufmann R. Raman and J.F. Sibeyn "Routing on meshes with buses" Algorithmica vol.18 pp.417-444 1997.
20. D. Krizanc "Oblivious routing with limited buffer capacity" J. Computer and System Sciences vol.43 pp.317-327 1991.
21. M. Kunde and T. Tensi "Multi-packet routing on mesh connected processor arrays" Proc. Symposium on Parallel Algorithms and Architectures pp.336-343 1989.
22. M. Kunde "Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound" Proc. European Symposium on Algorithms pp.272-283 1993.
23. M. Kunde "Routing and sorting on mesh connected processor arrays" Proc. VLSI Algorithms and Architectures LNCS 319 pp.423-433 1988.
24. F.T. Leighton "Average case analysis of greedy routing algorithms on arrays" Proc. ACM Symposium on Parallel Algorithms and Architectures pp.2-10 1990.
25. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes Morgan Kaufmann 1992.
26. F.T. Leighton F. Makedon and I. Tollis "A 2n - 2 step algorithm for routing in an n x n array with constant queue sizes" Algorithmica vol.14 pp.291-304 1995.
27. L.Y.T. Leung and S.M. Shende "On multidimensional packet routing for meshes with buses" J. Parallel & Distributed Computing vol.20 pp.187-197 1994.
28. T.R. Mathies "Percolation theory and computing with faulty arrays of processors" Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms pp.100-103 1992.
29. R. Motwani and P. Raghavan Randomized Algorithms Cambridge University Press 1995.
30. P. Raghavan "Robust algorithms for packet routing in a mesh" Math. Systems Theory vol.28 pp. 1-11 1995.
31. S. Rajasekaran and R. Overholt "Constant queue routing on a mesh" J. Parallel & Distributed Computing vol.15 pp.160-166 1992.
32. S. Rajasekaran and T. Tsantilas "Optimal routing algorithms for mesh-connected processor arrays" Algorithmica vol.8 pp.21-38 1992.
33. S. Rajasekaran "k-k routing k-k sorting and cut-through routing on the mesh" J. Algorithms vol.19 no.3 pp.361382 1995.
34. J.F. Sibeyn B.S. Chlebus and M. Kaufmann "Deterministic permutation routing on meshes" J. Algorithms vol.22 pp.111-141 1997.
35. L.G. Valiant and G.J. Brebner "Universal schemes for parallel communication" Proc. 13th Symposium on Theory of Computing pp.263-270 1981.