Sorting sequential files with limited auxiliary storage

Authors:
David S. Burris;Kurt Schember
Affiliations:
Sam Houston State University, Huntsville, TX;University of Texas Arlington, Arlington, TX
Venue:
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Year:
1980

Citing 8
Cited 0

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Sorting

ACM Computing Surveys (CSUR)
An efficient, incremental, automatic garbage collector

Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Fundamentals of Data Structures in Pascal

Fundamentals of Data Structures in Pascal
Data Structures: Theory and Practice

Data Structures: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of sorting files whose size exceeds main memory and for which only limited auxiliary memory resources are available.