Multiphase sorting

Authors:
Harold H. Manker
Affiliations:
IBM Corp., Endicott, NY
Venue:
Communications of the ACM
Year:
1963

Citing 1
Cited 2

A generalized polyphase merge algorithm

Communications of the ACM

Sorting

ACM Computing Surveys (CSUR)
Optimizing the polyphase sort

Communications of the ACM

Quantified Score

Hi-index	48.23

Visualization

Abstract

With a limited number of tape drives available for sorting, the polyphase technique of merging provides faster sorting than the conventional balanced method of merging. This paper is an attempt to describe the polyphase method used in the IBM 1401 Sort 2 program for a computer system with four tape drives available.