Abstract
Two algorithms to perform sorting on parallel machines are presented. The first is a modified version of Batcher’s merge-exchange sort, but with an explicitly recursive structure involving fewer data passing operations between distant processors. The other is a version of the radix sort, which does not require the array elements to be moved between processors, but gradually computes the sequence number of each element using bit-serial counting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. E. Knuth, The art of computer programming, vol. 3, Sorting and Searching, Addison Wesley, pp. 111–114, pp. 224–239, (1973).
K. E. Batcher, Proc. AFIPS Spring Joint Comput. Conf., vol. 32, pp. 307–314, (1968).
W. D. Hillis and G. L. Steele, Data parallel algorithms, CACM, vol. 29, pp. 1170–1183, (1986).
C. K. Yuen, A new version of the merge exchange sort with an explanatory proof, Tech. Rep. TR12/85, DISCS, NUS, (1985). (Also published in Int. Jour. of Sci. & Eng., 1986).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer Basel AG
About this chapter
Cite this chapter
Yuen, C.K. (1988). Some Sorting Algorithms for Parallel Machines. In: Agarwal, R.P., Chow, Y.M., Wilson, S.J. (eds) Numerical Mathematics Singapore 1988. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 86. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6303-2_42
Download citation
DOI: https://doi.org/10.1007/978-3-0348-6303-2_42
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-2255-7
Online ISBN: 978-3-0348-6303-2
eBook Packages: Springer Book Archive