Abstract
By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd-even transposition-sort algorithm to finish in (N + 1)/2 loop times (periods) using (N − 1) comparators. The sorting can be overlapped with input/output; the percentage of unoverlapped sorting times is less than 20% of the total time with a single ladder, less than 6% using two ladders, and is zero with a sufficient number of ladders.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. E. Knuth,The Art of Computer Programming, Vol. 3 (Addison Wesley, Reading, Mass., 1973).
T. C. Chen and C. Tung, “Storage management operations in linked uniform shift register loops,”IBM J. Res. Dev. 20:123–131 (March 1976).
C. Tung, T. C. Chen, and H. Chang, “Bubble ladder for information processing,”IEEE Trans. Magn. Mag-11:1163–1165 (September 1975).
See, for example, H. Chang,Magnetic Bubble Technology (IEEE Press, New York, 1975), pp. 37–41.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, T.C., Eswaran, K.P., Lum, V.Y. et al. Simplified odd-even sort using multiple shift-register loops. International Journal of Computer and Information Sciences 7, 295–314 (1978). https://doi.org/10.1007/BF00991635
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991635