Skip to main content
Log in

Diamond a sorting method for vector machines

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

Abstract

A method for parallel sorting in vector machines is described. It is shown that it has complexityO(N(logN)2).

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. E. Batcher,Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference 32 (1968), 307–314.

    Google Scholar 

  2. D. G. Korn and J. J. Lambiotte,Computing the fast Fourier transform on a vector computer, Math. Comp. 33 (1979), 977–992.

    Google Scholar 

  3. D. E. Knuth,The Art of Computer Programming, Vol. 3 Sorting and Searching, Addison-Wesley Publishing Company, Reading, Massachusetts (1973).

    Google Scholar 

  4. C. L. Liu,Analysis and synthesis of sorting alghorithms, SIAM J. Comput. 1 (1971), 290–304.

    Google Scholar 

  5. H. S. Stone,Sorting on STAR, IEEE Trans. on Software 2 (1978), 133–194.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brock, H.K., Brooks, B.J. & Sullivan, F. Diamond a sorting method for vector machines. BIT 21, 142–152 (1981). https://doi.org/10.1007/BF01933158

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation