Is automatic “folding” of programs efficient enough to displace manual?

  title={Is automatic “folding” of programs efficient enough to displace manual?},
  author={D. Sayre},
  journal={Commun. ACM},
  • D. Sayre
  • Published 1 December 1969
  • Computer Science
  • Commun. ACM
The operation of “folding” a program into the available memory is discussed. Measurements by Brawn et al. and by Nelson on an automatic folding mechanism of simple design, a demand paging unit built at the IBM Research Center by Belady, Nelson, O'Neill, and others, permitting its quality to be compared with that of manual folding, are discussed, and it is shown that given some care in use the unit performs satisfactorily under the conditions tested, even though it is operating across a memory… 

Figures from this paper

On modeling program behavior
This is a paper about the history of the working set model for program behavior, and the purpose of a program model is providing a basis for determining a program's working information at a given time and predicting what it will be at a future time.
The Science of Computing: Virtual Memory
In the March-April issue, I described how a computer's storage system is organized as a hierarchy consisting of cache, main memory, and secondary memory (e.g., disk). The cache and main memory form a
Virtual memory
Two principal methods for implementing virtual memory, segmentation and paging, are compared and contrasted and are shown to be controllable by a proper combination of hardware and memory management policies.
Virtual Memory
  • Peter J. Denning
  • Computer Science
    Wiley Encyclopedia of Computer Science and Engineering
  • 2008
Virtual memory is the simulation of a storage space so large that programmers do not need to reprogram or recompile their works when the capacity of a local memory or the configuration of a network
The story of virtual memory, from the Atlas Computer at the University of Manchester in the 1950s to the multicomputers and World Wide Web on the 1990s, is a story of machines helping programmers with protection of information, reuse and sharing of objects, and linking of program components.
Measurement and Improvement of Program Behavior under Paging Systems
  • J. Baer, G. Sager
  • Computer Science
    Statistical Computer Performance Evaluation
  • 1972
Some programming techniques for processing multi-dimensional matrices in a paging environment
The focus of this paper is to analyze programming techniques which will reduce the number of page faults in matrix operations and thereby improve program performance.
Working Set Analytics
This tutorial traces the development of working set theory from its origins to the present day, and presents the powerful, linear-time algorithms for computing working set statistics and applying them to the design of memory systems.
On evaluating parallel computer systems
A workshop was held in an attempt to program real problems on the MIT Static Data Flow Machine to explore principles for the evaluation of computer systems employing new architectures.
Working sets today
The argument why it is unlikely that anyone will find a cheaper nonlookahead memory policy that delivers significantly better performance is outlined.


Program behavior in a paging environment
The M44/44X system, an experimental time-shared paging system designed and implemented at IBM Research, is investigated more thoroughly from a user's viewpoint and some important questions related to program behavior in a paging environment are answered.
Experience using a time-shared multi-programming system with dynamic address relocation hardware
The IBM Research M44 computer is an experimental machine which was installed in the Thomas J. Watson, Sr. Research Center, in Yorktown Heights, New York, in November of 1964. The machine is an
A time-sharing system using an associative memory
The hardware scheme designed to implement an experimental IBM System/360, Model 40 time-sharing system will be discussed. The concept of a virtual system will be introduced which allows up to fifteen
An evaluation of program performance on the M44/44X system, Pt. I
  • IBM Res. Rep. RC-2083, May
  • 1968
A queueing approach to the replacement problem in paging machines
  • IBM Res. Rep. RC-2262,
  • 1968
A queueing approach to the replacement problem in paging machines
  • IBM Res. Rep
  • 1968
Unpublished work
  • 660 Communications of the ACM
  • 1969