Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound

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

Volumn 726 LNCS, Issue , 1993, Pages 272-283

  Kunde, Manfred ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ROUTING PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 85029421552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57273-2_62     Document Type: Conference Paper

References (20)

1. Annexstein, F. and Baumslag, M. A unified approach to off-line permutation routing on parallel networks. Proc. of SPAA 90. Hand of Crete, 1990, pp. 398-406.
2. Kaklamanis, C., Krizanc, D., Narayanan, L. and Tsantilas, T. Randomized Sorting and Selection on Mesh-Connected Processor Arrays. Proceedings of SPAA 91. Hilton Head, South Carolina, 1991, pp. 17-28.
3. Kaklamanis, C., Krizanc Optimal Sorting on Mesh-Connected Processor Arrays. Proceedings of SPAA 92. San Diego, California, 1992, pp. 50-59.
4. Kaufmann, M., Rajasekaran, S., Sibeyn, J. Matching the Bisection Bound for Routing and Sorting on the Mesh. Proc. of SPAA 92. San Diego, California, 1992, pp. 31-40
5. Kaufmann, M., S., Sibeyn, J. Optimal Multi-packet Routing on the Torus. Proc. Third Scandinavian Workshop on Algorithm Theory, 1992, pp. 118-129.
6. Kaufmann, M., S., Sibeyn, J. Optimal k - k Sorting on Meshes and Tori. Submitted.
7. Kunde, M. Routing and Sorting on Mesh-Connected Arrays. In J.H. Reif (ed.). Proceedings of the 3rd AWOC 88, Lect. Notes Comp. Sci. 319, Springer, Berlin, 1988, pp. 423-433.
8. Kunde, M. Balanced Routing: Towards the Distance Bound on Grids. Proceedings of SPAA 91. Hilton Head, South Carolina, 1991, pp. 260-271.
9. Kunde, M. Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound. Proc. of FOCS 91. San Juan, Puerto Rico, 1991, pp. 141-150.
10. Kunde, M. Routing and Sorting on Grids. Habilitationsschrift. TU Munich, Munich, 1991, pp. 177.
11. Kunde, M. and Tensi, T. k-k routing on multidimensional mesh-connected arrays. J. of Parallel and Distributed Computing, 11 (1991), pp. 146-155
12. Leighton, T., Makedon, F. and Tollis, I. A 2n-2 Step Algorithm for Routing in an n x n Array with Constant Size Queues. Proc. of SPAA 89. Santa Fe, 1989, pp. 328-335.
13. Leighton, T. Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, San Mateo, California, 1992.
14. Leighton, T. Methods for Message Routing in Parallel Machines. Proceedings of the 1992 ACM Symposium on Theory of Computation, STOC 92. 1992, pp. 77-96.
15. Park, A. and Balasubramanian, K. Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers. J. of Parallel and Distributed Computing, 9 (1990), pp. 318-322
16. Ma, Y., Sen, S. and Scherson, I.D. The distance bound for sorting on mesh-connected processor arrays is tight. Proceedings FOCS 86, pp. 255-263.
17. Rajasekaran, S. and Overholt, R. Constant Queue Routing on a Mesh. In Choffrut, C. and Jantzen, M. (eds.), Proceedings of STACS 91, Lect. Notes Comp. Sci., vol. 480, Springer, Berlin, 1991, pp. 444-455.
18. Schnorr, C.P. and Shamir, A. An optimal sorting algorithm for mesh-connected computers. Proceedings STOC 1986. Berkley, 1986, pp. 255-263.
19. Thompson, C.D. and Kung, H.T. Sorting on a mesh-connected parallel computer. CACM 20 (1977), pp. 263-270.
20. Valiant, L.G. and Brebner, G.J. Universal schemes for parallel communication, Proceedings STOC 81, pp. 263-277.