Skip to main content
Log in

A parallel selection algorithm

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The problem of selecting thekth largest or smallest element of {x i +y j |x i εX andy j εYi,j} whereX=(x 1,x 2, ..,x n ) andY=(y 1,y 2, ...,y n ) are two arrays ofn elements each, is considered. Certain improvements to an existing algorithm are proposed. An algorithm requiringO(logk·logn) units of time on a Shared Memory Model of a parallel computer havingO(n 1+1/β) processors is presented where β is a pre-assigned constant lying between 1 and 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Gupta and G. P. Bhattacharjee,Parallel generation of combinations lexicographically, Proc. of 1st conf. of Foundation of Software Technology and Theoretical Computer Science, India (1981), 193–200.

  2. L. H. Harper, T. H. Payne, J. E. Savage and E. Strans,Sorting X+Y, CACM, 18, 6 (1975), 347–349.

    Google Scholar 

  3. D. Heller,A survey of parallel algorithms in numerical linear algebra, Technical Report, Department of Comp. Sc., Carnegie-Mellon University, Pittsburgh (1976).

    Google Scholar 

  4. D. S. Hirschberg,Fast parallel sorting algorithms, CACM, 21, 8 (1978), 657–661.

    Google Scholar 

  5. D. B. Johnson and T. Mizoguchi,Selecting the kth element in X+Y and X 1+X 2+...X n , SIAM J. Comput. 7, 2 (1978), 147–153.

    Google Scholar 

  6. D. E. Knuth,The Art of Computer Programming Vol. 3, Addison-Wesley, Reading Mass. (1973).

    Google Scholar 

  7. H. T. Kung,Synchronized and asynchronous parallel algorithms for multiprocessors, in:Algorithms and Complexity: New Directions and Recent Results, edited by J. F. Traub, Academic Press, N.Y. (1976), 153–200.

    Google Scholar 

  8. W. L. Miranker,A survey of parallelism in numerical analysis, SIAM Review 13, 4 (1971), 524–527.

    Google Scholar 

  9. D. Nassimi and Sarataj Sahni,Parallel permutation and sorting algorithms and a new generalized connection network, University of Minnesota, TR-79-8 (1979).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupta, P., Bhattacharjee, G.P. A parallel selection algorithm. BIT 24, 274–287 (1984). https://doi.org/10.1007/BF02136026

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02136026

Keywords

Navigation