An anomaly in space-time characteristics of certain programs running in a paging machine

  • Authors:
  • L. A. Belady;R. A. Nelson;G. S. Shedler

  • Affiliations:
  • IBM Thomas J. Watson Research Center, Yorktowm Heights, NY;IBM Thomas J. Watson Research Center, Yorktowm Heights, NY;IBM Thomas J. Watson Research Center, Yorktowm Heights, NY

  • Venue:
  • Communications of the ACM
  • Year:
  • 1969

Quantified Score

Hi-index 48.27

Visualization

Abstract

The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running time.An informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented.