The Input/Output Complexity of Sorting and Related Problems

Communications of the ACM

Volumn 31, Issue 9, 1988, Pages 1116-1127

  Aggarwal, Alok ^a   Vitter, Jeffrey S ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

Distribution sort; fast Fourier transform; input; magnetic disk; merge sort; networks; output; pebbling; secondary storage; sorting

Indexed keywords

COMPUTER METATHEORY; COMPUTER PROGRAMMING - ALGORITHMS;

INPUT/OUTPUT COMPLEXITY; LOWER BOUNDS; UPPER BOUNDS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0024082546     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/48529.48535     Document Type: Article

References (10)

1. Beigel, R., and Gill, J. Personal Communication. 1986.
2. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., and Taijan, R.E. Time bounds for selection. J. Comput. Syst. Sci. 7 (1973), 448–461.
3. Floyd, R.W. Permuting information in idealized two-level storage. In Complexity of Computer Calculations, R. Miller and J. Thatcher, Eds. Plenum, New York, 1972, pp. 105–109.
4. Hong, J.W., and Kung, H.T. I/O complexity: The red-blue pebble game. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wisconsin, Oct.). pp. 326–333. 1981.
5. Knuth, D.E. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
6. Kwan, S.C., and Baer, J.L. The I/O performance of multiway merge-sort and tag sort. IEEE Trans. Comput. C-34, 4 (Apr. 1985), 383–387.
7. Leighton, F.T. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. C-34, 4 (Apr. 1985).
8. Lindstrom, E.E., and Vitter, J.S. The design and analysis of Bucket-Sort for bubble memory secondary storage. IEEE Trans. Comput. C-34, 3 (Mar. 1985), 218–233.
9. Savage, J.E., and Vitter, J.S. Parallelism in space-time tradeoffs. In Advances in Computing Research, Volume 4: Special Issue on Parallel and Distributed Computing. JAI Press, Greenwich, Conn., 1987, pp. 117–146.
10. Wu, C.L., and Feng, T.Y. The universality of the shuffle-exchange network. IEEE Trans. Comput. C-30, 5 (May 1981), 324–332.