Optimal deterministic sorting and routing on grids and tori with diagonals

Algorithmica (New York)

Volumn 25, Issue 4, 1999, Pages 438-458

  Kunde, M ^a   Niedermeier, R ^b   Reinhardt, K ^b   Rossmanith, P ^c  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Diagonal connections; Mesh connected processor arrays; Parallel algorithms; Parallel architectures; Routing; Sorting

Indexed keywords

EID: 8444247055     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009288     Document Type: Article

References (31)

1. G. Bilardi and F. P. Preparata. Horizons of parallel computation. Journal of Parallel and Distributed Computing, 27:172-182, 1995.
2. Y. Feldman and E. Shapiro. Spatial machines: a more realistic approach to parallel computation. Communications of the ACM, 35(10):61-73, October 1992.
3. C. Kaklamanis and D. Krizanc. Optimal sorting on mesh- connected processor arrays. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, pages 50-59, 1992.
4. M. Kaufmann, S. Rajasekaran, and J. F. Sibeyn. Matching the bisection bound for routing and sorting on the mesh. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, pages 31-40, 1992.
5. M. Kaufmann, J. F. Sibeyn, and T. Suel. Derandomizing algorithms for routing and sorting on meshes. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 669-679, 1994.
6. M. Kaufmann and J. F. Sibeyn. Randomized multipacket routing and sorting on meshes. Algorithmica, 17:224-244, 1997.
7. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley, Reading, MA, 1973.
8. D. Krizanc and L. Narayanan. Sorting and selection on arrays with diagonal connections. In First CanadaFrance Conference on Parallel and Distributed Computing, pages 121-136. Number 805 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, May 1994.
9. M. Kunde. Lower bounds for sorting on mesh-connected architectures. Acta Informatica, 24:121-130, 1987.
10. M. Kunde. Concentrated regular data streams on grids: sorting and routing near to the bisection bound. In Proceedings of the 32nd IEEE Conference on Foundations of Computer Science, pages 141-150, 1991.
11. M. Kunde. Block gossiping on grids and tori: sorting and routing match the bisection bound deterministically. In T. Lengauer, editor, Proceedings of the 1st European Symposium on Algorithms, Bad Honnef, September 1993, pages 272-283. Number 726 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993.
12. M. Kunde, R. Niedermeier, K. Reinhardt, and P. Rossmanith. Optimal average case sorting on arrays. In E. W. Mayr and C. Puech, editors, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, pages 503-514. Number 900 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
13. M. Kunde, R. Niedermeier, and P. Rossmanith. Faster sorting and routing on grids with diagonals. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, pages 225-236. Number 775 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
14. M. Kunde and T. Tensi. (k-k) Routing on multidimensional mesh-connected arrays. Journal of Parallel and Distributed Computing, 11:146-155, 1991.
15. H. T. Kung and C. E. Leiserson. Systolic arrays (for VLSI). In I. S. Duff and G. W. Stewart, editors, Sparse Matrix Proceedings 1978, pages 256-282. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1979.
16. F.T. Leighton. Methods for message routing in parallel machines. Theoretical Computer Science, 128:31-62, 1994.
17. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344-354, April 1985.
18. T. Leighton. Introduction to Parallel Algorithms and Architectures; Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
19. T. Leighton, F. Makedon, and I. Tollils. A 2n - 2 step algorithm for routing in an n × n array with constant size queues. In Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, pages 328-335, 1989.
20. Y. Ma, S. Shen, and I. D. Scherson. The distance bound for sorting on mesh-connected processor arrays is tight. In Proceedings of the 21th IEEE Conference on Foundations of Computer Science, pages 255-263, 1986.
21. D. Nassimi and S. Sahni. Data broadcasting in SIMD computers. IEEE Transactions on Computers, C-30(2):101-106, 1981.
22. S. Rajasekaran. k - k Routing, k - k sorting, and cut-through routing on the mesh. Journal of Algorithms, 19:361-382, 1995.
23. S. Rajasekaran and R. Overholt. Constant queue routing on a mesh. Journal of Parallel and Distributed Computing, 15(2):160-166, June 1992.
24. C. P. Schnorr and A. Shamir. An optimal sorting algorithm for mesh-connected computers. In Proceedings of the 18th ACM Symposium on Theory of Computing, pages 255-263, 1986.
25. A. Schorr. Physical parallel devices are not much faster than sequential ones. Information Processing Letters, 17:103-106, 1983.
26. J. F. Sibeyn. Overview of Mesh Results. Technical report MPI-I-95-1-018, Max-Planck-Institut für Informatik, Saarbrücken, 1995.
27. J. F. Sibeyn. Routing on triangles, tori and honeycombs. In W. Penczek and A. Szatas, editors, Proceedings of the 21st Conference on Mathematical Foundations of Computer Science, Cracow, September 1996, pages 529-541. Number 1113 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
28. L. Snyder. Introduction to the configurable, highly parallel computer. Computer, pages 47-56, January 1982.
29. C. T. Thompson and H. T. Kung. Sorting on a mesh-connected parallel computer. Communications of the ACM, 20:263-270, 1977.
30. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th ACM Symposium on Theory of Computing, pages 263-277, 1981.
31. P. Vitanyi. Locality, communication, and interconnect length in multicomputers. SIAM Journal on Computing, 17(4):659-672, August 1988.