On randomized and deterministic schemes for routing and sorting on fixed-connection networks

  • Torsten Suel
Workshop on Randomized Parallel Computing Panos Pardalos, University of Florida, Gainesville Sanguthevar Rajasekaran, University of Florida, Gainesville
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1388)

Abstract

We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on fixed-connection networks such as meshes, hypercubes or point-to-point networks. On the randomized side, we focus on the techniques of randomized routing and random sampling and their use in many algorithms, while our presentation of deterministic algorithms uses the example of the Columnsort algorithm to highlight techniques such as local sorting and deterministic sampling. We then demonstrate that there is a close relationship between the randomized and deterministic techniques presented, and illustrate how this relationship can be used to transform randomized into deterministic algorithms and vice versa. Our main objective here is to provide a more unified perspective on many of the algorithms in the literature, and we do not attempt to provide a complete survey of routing and sorting problems on parallel machines.

Keywords

Parallel Algorithm Parallel Machine Deterministic Algorithm Sorting Algorithm Processor Array 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Bertsekas, J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, 1989.Google Scholar
  2. 2.
    D. Helman, D. Bader, J. UJi, ‘Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study,’ Proc. 8th Symp. on Parallel Algorithms and Architectures, pp. 211–222, ACM, 1996.Google Scholar
  3. 3.
    C. Kaklamanis, D. Krizanc, L. Narayanan, Th. Tsantilas, ‘Randomized Sorting and Selection on Mesh Connected Processor Arrays,’ Proc. 3rd Symposium on Parallel Algorithms and Architectures, pp. 17–28, ACM, 1991.Google Scholar
  4. 4.
    C. Kaklamanis, D. Krizanc, ‘Optimal Sorting on Mesh-Connected Processor Arrays,’ Proc. 4th Symposium on Parallel Algorithms and Architectures, pp. 50–59, ACM, 1992.Google Scholar
  5. 5.
    C. Kaklamanis, D. Krizanc, S. Rao, 'simple Path Selection for Optimal Routing on Processor Arrays,’ Proc. 4th Symposium on Parallel Algorithms and Architectures, pp. 23–40, ACM, 1992.Google Scholar
  6. 6.
    M. Kaufmann, R. Rajasekaran, J. Sibeyn, ‘Matching the Bisection Bound for Routing and Sorting on the Mesh,’ Proc. 4th Symp. on Parallel Algorithms and Architectures, pp. 31–40, ACM, 1992.Google Scholar
  7. 7.
    M. Kaufmann, J. F. Sibeyn, T. Suel, ‘Derandomizing Algorithms for Routing and Sorting on Meshes,’ Proc. 5th Symp. on Discrete Algorithms pp. 669–679 ACM-SIAM, 1994.Google Scholar
  8. 8.
    M. Kaufmann, J. F. Sibeyn, T. Suel, ‘Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes,’ Proc. 3rd European Symp. on Algorithms, pp. 75–88, Springer LNCS 979, 1995.Google Scholar
  9. 9.
    M. Kunde, “Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,’ Proc. 1st European Symp. on Algorithms, LNCS 726, pp. 272–283, Springer, 1993.Google Scholar
  10. 10.
    F. T. Leighton, “Tight Bounds on the Complexity of Parallel Sorting,’ IEEE Transactions on Computers, C-34(4), pp. 344–354, 1985.Google Scholar
  11. 11.
    F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes, Morgan Kaufmann, 1991.Google Scholar
  12. 12.
    S. Rajasekaran, T. Tsantilas, ‘Optimal Routing Algorithms for Mesh-Connected Processor Arrays,’ Algorithmica, 8, pp. 21–38, 1992.MathSciNetGoogle Scholar
  13. 13.
    J. H. Reif, L. G. Valiant, ‘A logarithmic time sort for linear size networks,’ Journal of the ACM, 34, pp. 68–76, 1987.CrossRefGoogle Scholar
  14. 14.
    R. Reischuk, “Probabilistic Parallel Algorithms for Sorting and Selection,’ SIAM Journal of Computing, 14, pp. 396–411, 1985.CrossRefGoogle Scholar
  15. 15.
    R. Shankar, S. Ranka, ‘Performing Dynamic Permutations on a Coarse-Grained Parallel Machine,’ Proc. First International Workshop on Parallel Processing, 1994.Google Scholar
  16. 16.
    T. Suel, Improved bounds for routing and sorting on multi-dimensional meshes. In Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 26–35, June 1994.Google Scholar
  17. 17.
    L. G. Valiant, ‘A Scheme for Fast Parallel Communication,’ SIAM Journal on Computing, 11, pp. 350–361, 1982.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Torsten Suel
    • 1
  1. 1.Bell LaboratoriesMurray Hill

Personalised recommendations