Sorting with large volume, random access, drum storage

@article{Falkin1963SortingWL,
  title={Sorting with large volume, random access, drum storage},
  author={Joel Falkin and Sal Savastano},
  journal={Commun. ACM},
  year={1963},
  volume={6},
  pages={240-244}
}
An approach to sorting records is described using random access drum memory. The Sort program described is designed to be a generalized, self-generating sort, applicable to a variety of record statements. This description is divided into three parts. The first part presents the operating environment; the second defines the general solution; the third part describes the internal sort-merge technique. 

Figures from this paper

References

SHOWING 1-2 OF 2 REFERENCES
Maximum number of records sequenced per program pass (based on 16000-character core memory)
  • Maximum number of records sequenced per program pass (based on 16000-character core memory)
AMP ....... AMR ...... BCX ....... DYM ...... KLU ...... MLL ...... PEP ...... REP ...... SUN ....... TWA ...... TXN ...... UAL
  • AMP ....... AMR ...... BCX ....... DYM ...... KLU ...... MLL ...... PEP ...... REP ...... SUN ....... TWA ...... TXN ...... UAL