Segmentation and the Design of Multiprogrammed Computer Systems

Publisher Website
Google Scholar
Abstract
Problems that must be solved by any scheme for multiprogramming include: (1) dynamic allocation of information to a hierarchy of memory devices, (2) means for programs to reference procedures and data in a manner that is independent of their location in physical memory, (3) provision for the use of common procedure and data information by many pro- grams, (4) protection of system resources from unauthorized access, and (5) rapid switching of computation resources from one program to another. The concept of name space, the set of addresses a process can generate, is contrasted with the memory space, the set of physical memory locations, and memory referencing schemes are described by address mappings from name space into memory space. In this context, the inadequacies of several approaches for solving the problems of multiprogranuning become evident. The segmentation of procedures and data forms a model of program structure that is the basis of an address mapping function which will be a valuable feature of future computer systems.

This publication has 3 references indexed in Scilit: