K-K routing, K-K sorting, and cut-through routing on the mesh

Journal of Algorithms

Volumn 19, Issue 3, 1995, Pages 361-382

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013238536     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1995.1042     Document Type: Article

References (31)

1. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian paths and matchings, J. Comput. Systems Sci. 18 (1979), 155-193.
2. F. Annexstein and M. Baumslag, A unified approach to off-line permutation routing on parallel networks, in "Proc. Symposium on Parallel Algorithms and Architectures, 1990, " pp. 398-406; Math. Systems Theory 10 (1991).
3. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. of Math. Statist. 23 (1952), 493-507.
4. C. Kaklamanis and D. Krizanc, Optimal sorting on mesh connected processor arrays, in "Proc. ACM Symposium on Parallel Algorithms and Architectures, 1992, ” pp. 50-57.
5. C. Kaklamanis, D. Krizanc, L. Narayanan, and Th. Tsantilas, Randomized sorting and selection on mesh connected processor arrays, in "Proc. ACM Symposium on Parallel Algorithms and Architectures, 1991, ” pp. 17-28.
6. M. Kaufmann, S. Rajasekaran, and J. Sibeyn, Matching the bisection bound for routing and sorting on the mesh, in "Proc. ACM Symposium on Parallel Algorithms and Architectures, 1992, ” pp. 31-40.
7. D. Krizanc, A note on off-line permutation routing on a mesh connected processor array, in "Proc. International Conference on Computing and Information, 1991, " pp. 418-421.
8. M. Kumar and D. Hirschberg, An efficient implementation of Batcher's odd-even merge algorithm and its application to parallel sorting schemes, IEEE Trans. Comput. C-32 (1983), 254-264.
9. M. Kunde, Routing and sorting on mesh connected processor arrays, in "Proc. VLSI Algorithms and Architectures: AWOC 1988. Lecture Notes in Computer Science, Vol. 319, pp. 423-433, Springer-Verlag, Berlin/New York, 1988.
10. M. Kunde and T. Tensi, Multi-packet routing on mesh connected arrays, in “Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, " pp. 363-343.
11. M. Kunde, Concentrated regular data streams on grids: Sorting and routing near to the bisection bound, in "Proc. IEEE Symposium on Foundations of Computer Science, 1991, " pp. 141-150.
12. M. Kunde, Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound, in "Proc. First Annual European Symposium on Algorithms, " Lecture Notes in Computer Science, Vol. 726, pp. 272-283, Springer-Verlag, Berlin/New York, 1993.
13. T. Leighton, Average Case analysis of greedy routing algorithms on arrays, in "Proc. ACM Symposium on Parallel Algorithms and Architectures, 1990, " pp. 2-10.
14. T. Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, " Morgan Kaufmann. San Mateo, CA, 1992.
15. T. Leighton, F. Makedon, and I. G. Tollis, A 2n -2 step algorithm for routing in an n x n array with constant size queues in. "Proc. ACM Symposium on Parallel Algorithms and Architectures, 1989, " pp. 328-335.
16. Y. Ma, S. Sen, and I. Scherson, The distance bound for sorting on mesh connected processor arrays is tight, in "Proc. 27th IEEE Symposium on Foundations of Computer Science, 1986, " pp. 255-263.
17. F. Makedon and A. Simvonis, On bit Serial packet routing for the mesh and the torus, in "Proc. Third Symposium on Frontiers on Massively Parallel Computation, 1990, " pp. 294-302.
18. D. Nassimi and S. Sahni, An optimal routing algorithm for mesh connected parallel computers, J. Assoc. Comput. Mach. 27 (1980), 6-29.
19. A Park and K. Balasubramanian, Reducing communication costs for sorting on Mesh-Connected and linearly connected parallel computers, J. Parallel and Distrib. Comput. 9 (1990), 318-322.
20. C. S. Raghavendra and V. K. P. Kumar, Permutations on Illiac IV-type networks, IEEE Trans. Comput. C-35 (1986), 622-669.
21. S. Rajasekaran, "k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh, " Technical Report MS-CIS-91-93, Department of CIS, University of Pennsylvania, Philadelphia, PA 19104, Oct. 1991.
22. S. Rajasekaran, Randomized algorithms for packet routing on the mesh, in "Advances in Parallel Algorithms" (L. Kronsjo and D. Shumsheruddin, Eds.), pp. 277-301, Blackwell Sci., Oxford, 1992.
23. S. Rajasekaran and R. Overholt, Constant queue routing on a mesh, in "Proc. Symposium on Theoretical Aspects of Computer Science, 1990, " Lecture Notes in Computer Science, Vol. 480, pp. 444-455, Springer-Verlag, Berlin/New York, 1990; J. Parallel Distrib. Comput. 15 (1992), 160-166.
24. S. Rajasekaran and M. Raghavachari, Optimal randomized algorithms for multipacket and cut through routing on the mesh, in "Proc. IEEE Symposium on Parallel and Distributed Processing, 1991, " pp. 305-311; J. Parallel Distrib. Comput. 26 (1995), 257-260.
25. S. Rajasekaran and S. Sen, Random sampling techniques and parallel algorithms design, in "Synthesis of Parallel Algorithms" (J. H. Reif, Ed.) pp. 411-451, Morgan-Kaufman, San Mateo, CA, 1993.
26. S. Rajasekaran and Th. Tsantilas, An optimal randomized routing algorithm for the mesh and a class of efficient mesh like routing networks, in "Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science, 1987, " Lecture Notes in Computer Science, Vol. 287, pp. 226-241, Springer-Verlag, Berlin/New York, 1987.
27. S. Rajasekaran and Th. Tsantilas, Optimal routing algorithms for mesh-connected processor arrays, Algorithmica 8 (1992), 21-38.
28. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SJAM J. Comput. 14 No. 2 (1985), 396-411.
29. C. P. Schnorr and A. Shamir, An optimal sorting algorithm for mesh connected computers, in "Proc. 18th ACM Symposium on Theory of Computing, 1986, " pp. 255-263.
30. C. D. Thompson and H. T. Kung, Sorting on a mesh connected parallel computer, Comm. ACM 20 (1977), 263-270.
31. L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in "Proc. 13th ACM Symposium on Theory of Computing, 1981, " pp. 263-277.