Program organization and record keeping for dynamic storage allocation

@inproceedings{Holt1961ProgramOA,
  title={Program organization and record keeping for dynamic storage allocation},
  author={Anatol W. Holt},
  booktitle={CACM},
  year={1961}
}
  • A. Holt
  • Published in CACM 1 October 1961
  • Computer Science
The material presented in this paper is part of the design plan of the core allocation portion of the ACSI-MATIC Programming System. Project ACSI-MATIC is concerned with the application of computer techniques to the activities of certain headquarters military intelligence operations of the U.S. Army. In describing features of organization and record keeping there has been no attempt at completeness, but rather an exploration of the salient aspects of the system to some reasonable level of… 

Figures from this paper

A Dynamic Memory Allocation Algorithm
TLDR
A dynamic memory allocation algorithm is presented making use of a priori information about a computer program based upon priori knowledge of interaction factors between any two space-taking entities associated with a computation.
Architectural approaches for code injection defense at the user and kernel levels
TLDR
This dissertation proposes an alternative memory architecture, the split memory architecture (SMA), which is not susceptible to code injection attacks, and demonstrates the efficacy of the SMA approach at the user-level by presenting the design, implementation, and evaluation of an operating system level patch to run a process inside an SMA.
Architectural support for software-based protection
TLDR
The first part of this paper shows how modest Instruction Set Architecture (ISA) support can replace such guard code with single instructions for CFI, and presents ISA support for XFI, in the form of simple bounds-check instructions.
Fundamentals of Time Shared Computers
TLDR
The instantaneous nature of a timr-sharing system includes both direct terminals for the users and rapid response to user demands, which is, users are “on line” and s&ved in “real time”.
Virtual memory
TLDR
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
TLDR
The story of virtual memory from then to now is a story about machines helping programmers solve problems in storage allocation, protection of information, sharing and reuse of objects, and linking of program components.
Programming semantics for multiprogrammed computations
The semantics are defined for a number of meta-instructions which perform operations essential to the writing of programs in multiprogrammed computer systems. These meta-instructions relate to
Naming and Binding of Objects
  • J. Saltzer
  • Computer Science
    Advanced Course: Operating Systems
  • 1978
TLDR
This chapter examines naming functions that are usually implemented (or desired) in two naming structures commonly encountered inside computer systems: addressing architectures and file systems, and some of the design tradeoffs encountered in a variety of contemporary computer systems.
...
...

References

SHOWING 1-3 OF 3 REFERENCES
Common Programming Language Task of Project ADAR, carried on at the Moore School
  • Common Programming Language Task of Project ADAR, carried on at the Moore School
Discussion of the problem of definition of storage allocation
  • Comm. ACM 4 (May 1961),
  • 1961
Automatic Code Translation System
  • Automatic Code Translation System