Abstract
A method for parallel sorting in vector machines is described. It is shown that it has complexityO(N(logN)2).
Similar content being viewed by others
References
K. E. Batcher,Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference 32 (1968), 307–314.
D. G. Korn and J. J. Lambiotte,Computing the fast Fourier transform on a vector computer, Math. Comp. 33 (1979), 977–992.
D. E. Knuth,The Art of Computer Programming, Vol. 3 Sorting and Searching, Addison-Wesley Publishing Company, Reading, Massachusetts (1973).
C. L. Liu,Analysis and synthesis of sorting alghorithms, SIAM J. Comput. 1 (1971), 290–304.
H. S. Stone,Sorting on STAR, IEEE Trans. on Software 2 (1978), 133–194.
Author information
Authors and Affiliations
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933158