Advertisement

Fast deterministic selection on mesh-connected processor arrays

  • Danny Krizanc
  • Lata Narayanan
  • Rajeev Raman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 560)

Abstract

We present a deterministic algorithm for selecting the element of rank k among N=n2 elements, 1≤k≤N, on an n×n mesh-connected processor array in (1.44+ε parallel computation steps, for any constant ε>0, using constant sized queues. This is a considerable improvement over the best previous deterministic algorithm, which was based upon sorting and required 3n steps. Our algorithm can be generalized to solve the problem of selection on higher dimensional meshes, achieving time bounds better than the known results in each case.

Keywords

Parallel Algorithm Deterministic Algorithm Sorting Algorithm Sample Element Corner Vertex 
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. [AKSS89]
    M. Ajtai, N. Komlos, W. L. Steiger, and E. Szemeredi. Optimal parallel selection has complexity o(loglogn). Journal of Computer and System Science, 38(1):125–133, February 1989.CrossRefGoogle Scholar
  2. [AP90]
    Y. Azar and N. Pippenger. Parallel selection. Discrete Applied Mathematics, 27:49–58, 1990.CrossRefGoogle Scholar
  3. [BFP+72]
    M. Blum, R. Floyd, V. R. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection. Journal of Computer and System Science, 7(4):448–461, 1972.Google Scholar
  4. [Col88]
    R. Cole. An optimally efficient selection algorithm. Information Processing Letters, 26:295–299, 1988.CrossRefMathSciNetGoogle Scholar
  5. [CP90]
    R. Cypher and G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. In Symposium on the Theory of Computation, pages 193–203, 1990.Google Scholar
  6. [KKNT91]
    C. Kaklamanis, D. Krizanc, L. Narayanan, and A. Tsantilas. Randomized sorting and selection on mesh-connected processor arrays. In Symposium on Parallel Algorithms and Architecture, pages 17–28, 1991.Google Scholar
  7. [Kun88]
    M. Kunde. Routing and sorting on mesh-connected arrays. In Aegean Workshop on Computing: VLSI algorithms and architectures. Vol.319 of Lecture Notes in Computer Science, Springer Verlag, NY, pages 423–433, 1988.Google Scholar
  8. [Kun89]
    M. Kunde. 1-selection and related problems on grids of processors. Technical report, Institut fur Informatik, Technische Universitat, Munchen, 1989.Google Scholar
  9. [LMT89]
    F.T. Leighton, F. Makedon, and I. Tollis. A 2n-2 step algorithm for routing in an n×n array with constant size queues. In Symposium on Parallel Algorithms and Architecture, pages 328–335, 1989.Google Scholar
  10. [MS91]
    F. Makedon and A. Simvonis. Many-to-one packet routing for the mesh. Technical report, University of Texas at Dallas, 1991.Google Scholar
  11. [Pla89a]
    G. Plaxton. Load balancing, selection and sorting on the hypercube. In Symposium on Parallel Algorithms and Architecture, pages 64–73. ACM, 1989.Google Scholar
  12. [Pla89b]
    G. Plaxton. On the network complexity of selection. In Symposium on the Foundations of Computer Science, pages 396–401. IEEE, 1989.Google Scholar
  13. [Rei85]
    R. Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM Journal of Computing, 14(2):396–411, May 1985.CrossRefGoogle Scholar
  14. [RT]
    S. Rajasekaran and T. Tsantilas. Optimal algorithms for routing on the mesh. Algorithmica. to appear.Google Scholar
  15. [SS86]
    C. Schnorr and A. Shamir. An optimal sorting algorithm for mesh connected computers. In Symposium on the Theory of Computation, pages 255–263, 1986.Google Scholar
  16. [TK77]
    C. Thompson and H. Kung. Sorting on a mesh connected parallel computer. Communications of the ACM, 20:263–270, 1977.CrossRefGoogle Scholar
  17. [Val75]
    L. Valiant. Parallelism in comparison problems. SIAM Journal of Computing, 4:348–355, 1975.CrossRefGoogle Scholar
  18. [Vis87]
    U. Vishkin. An optimal parallel algorithm for selection. In Advances in Computing Research, pages 79–85. Jai Press, inc., 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Danny Krizanc
    • 1
  • Lata Narayanan
    • 1
  • Rajeev Raman
    • 1
  1. 1.Department of Computer ScienceUniversity of RochesterRochester

Personalised recommendations