Modularity and the sequential file update problem
MICHAEL R. LEVY · Communications of the ACM · 1982
The best-known solution to the sequential file update problem is the balanced-line algorithm. Here, the problem is solved using abstract data types and the resulting Cobol program illustrated. It is suggested that the program's modular decomposition aids in the development of the solution.