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.
No takes yet. Share an insight, caveat, or question.
Belady et al. (1969) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: