Multiprogramming System Research Articles

On the Design of Bayesian Storage Allocation Algorithms for Paging and Segmentation

This short note focuses attention upon techniques for dynamic memory allocation in multiprogrammed systems which employ the addressing mechanisms of paging and segmentation. Here, event indicators and mathematical tools are presented which supply characterizations of the paging and segmentation addressing processes. It is shown that these statistical characterizations form data bases which can be used to derive Bayesian storage allocation algorithms conditionally based upon usage, demand, and processing history. It is argued that these characterizations, and algorithms similar to those constructed here, provide a flexible basis for efficient memory management in multiprogrammed, and by extension, time-shared environments. Although emphasis is directed to managing primary (main) memory residence, the techniques could be extended to govern memory management for a hierarchy of storage devices.

Omnibus-A Multiprogramming Executive System for the Zero Gradient Synchrotron Control Computer

As the digital computer undergoes increasing utilization as an on-line evaluation and feedback control device for an accelerator, it becomes necessary to provide it with a multiprogramming executive software system. The system should be capable of accommodating several on-line control functions simultaneously so that these functions can be developed independently. The system should also provide for general purpose off-line utilization, such as new program development, to proceed simultaneously with and unimpeded by the continuous operation of the accelerator. OMNIBUS, the multiprogramming executive system now in use with the Zero Gradient Synchrotron (ZGS) control computer, incorporates these features and several others not found in commercially available multiprogramming systems. OMNIBUS obtains data for the various control programs from locations and at specific times requested by the programs and also provides the control link; either by modifying the program stored in the timing system of the synchrotron, or by direct transmission of timing pulses or digitalinformation to the accelerator. The system provides for operator modification of the various control programs and communications with them without interrupting their on-line control or monitoring functions.

Markov chain analyses of multiprogrammed computer systems

AbstractMost operating systems for large computing facilities involve service disciplines which base, to some extent, the sequencing of object program executions on the amount of running time they require. It is the object of this paper to study mathematical models of such service disciplines applicable to both batch and time‐shared processing systems. In particular, Markov queueing models are defined and analyzed for round‐robin and foreground‐background service disciplines. With the round‐robin discipline, the service facility processes each program or job for a maximum of q seconds; if the program's service is completed during this quantum, it leaves the system, otherwise it returns to the end of the waiting line to await another quantum of service. With the foreground‐background discipline each new arrival joins the end of the foreground queue and awaits a single quantum of service. If it requires more it is subsequently placed at the end of the background queue which is allocated service only when the foreground queue is empty.The analysis focuses on the efficiency of the above systems by assuming a swap or set‐up time (overhead cost) associated with the switching of programs on and off the processor. The analysis leads to generating functions for the equilibrium queue length probabilities, the moments of this latter distribution, and measures of mean waiting times. The paper concludes with a discussion of the results along with several examples.

A Multiprogrammed Operating System for Nuclear Physics Data Acquisition

A multiprogrammed operating system for nuclear physics data acquisition has been developed as part of a Yale/IBM Joint Study. The system supports multiple users in a fully protected environment. Features of the system include dynamic storage allocation, a fully reentrant supervisor, language and device independence, dynamic priorities, virtual device utilities, and extensive inter-task communication facilities. An application example is presented.

Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System

Properly scheduling the usage of input output devices is an important aspect of the design of modern multiprogramming systems featuring a paged environment. In this paper magnetic drums in the role of auxiliary memories are studied in the context of these systems. It is the nature of the drum, its usage by the system, and the organization of information on the drum are discussed in the light of current system designs. Mathematical models are then defined such that two extremes in scheduling disciplines are represented in a system in which page requests are assumed to arrive singly and at random. The analysis leads to results for a measure of drum utilization, a generating function for the queue length probabilities in equilibrium, the mean queue length, and the mean waiting time. Finally, the significance of the results is discussed along with some examples.

R68-52 The Structure of the "The"-Multiprogramming System

This paper is worthy of attention. Written with the facility one has grown to expect from Prof. Dijkstra, this is an announcement of a new operating system designed and constructed at the Technologi-cal University at Eindhoven for the EL X8.

A constructive approach to the problem of program correctness

As an alternative to methods by which the correctness of given programs can be established a posteriori, this paper proposes to control the process of program generation such as to produce a priori correct programs. An example is treated to show the form that such a control might then take. This example comes from the field of parallel programming; the way in which it is treated is representative of the way in which a whole multiprogramming system has actually been constructed.

Operating Systems: On overcoming high-priority paralysis in multiprogramming systems

High-priority paralysis is the degradation that can occur in multiprogramming systems when scheduling is based primarily on preassigned priorities. It can be alleviated by modifying the scheduling algorithm to maximize the number of programs active at one time. The case history given in this paper indicates two general methods by which simultaneity can be increased. Possible refinements in the scheduling algorithm for future improvements are considered briefly.

The structure of the “THE”-multiprogramming system

A multiprogramming system is described in which all activities are divided over a number of sequential processes. These sequential processes are placed at various hierarchical levels, in each of which one or more independent abstractions have been implemented. The hierarchical structure proved to be vital for the verification of the logical soundness of the design and the correctness of its implementation.

Computer-stored medical record

In order to satisfy all the input and output requirements and process all the forms of essential medical information for all office and hospital visits for the lifetime of a patient, it has become necessary to develop a more complex programming system for a variable-length and variable-format computer-stored medical record. This programming system is designed to control and coordinate general and fundamental routines which include the handling of direct access storage, as well as remote terminal input and output devices. An encoded computer-stored patient medical record, organized basically as a tree-structure record, is partitioned into patients' visits which are subdivided into parts containing medical history, examination findings, diagnoses, laboratory and X-ray reports, ets. Active patient records are permanently stored on a large mass storage (Data Cell) device, but temporarily are moved to high-speed random-access disc drives while the patient is under actual care in the hospital or outpatient clinics. Although the computer record can store straight English text, in order to conserve storage space, the system utilizes an English word dictionary to encode diagnoses and an item catalog to identify standard tests and procedures, standard medical questions, etc. To permit convenient revision of input and output forms, the system includes an input language compiler, a medical report generator, and an information retrieval compiler. The multiprogramming system allows multiple medical funtions to operate simultaneously and permit access to the same patient's records. Such a system requires extensive communications equipment to handle input and output requirements for multiple facilities and at least some limited backup capabilities in the event of equipment failure.

Three criteria for designing computing systems to facilitate debugging

The designer of a computing system should adopt explicit criteria for accepting or rejecting proposed system features. Three possible criteria of this kind are input recordability, input specifiability, and asychronous reproducibility of output. These criteria imply that a user can, if he desires, either know or control all of the influences affecting the content and extent of his computer's output. To define the scope of the criteria, the notion of an abstract machine of a programming language and the notion of a virtual computer are explained. Examples of applications of the criteria concern the reading of a time-of-day clock, the assignment of capability indices, and memory reading protection in multiprogrammed systems.

Operating Systems: Program overlay techniques

The general features of program overlay systems are described. Three main types—automatic, semiautomatic and non-automatic—are classified, and the programming techniques are explained as a function of machine hardware and other system features. The implementation of a semiautomatic overlay facility in a multiprogrammed system on the CDC 6600 is described in detail, with special reference to real time applications.

Statistical Analysis of Paged and Segmented Computer Systems

This paper discusses some optimum design problems which arise when paging and segmentation are used in a multiprogrammed computer system, and suggests approaches to their solution. It is argued that design optimization depends fundamentally on the statistics of the typical software load presented to the computer system, and also that the investigation requires the aid of a total system model. Statistical techniques for defining software characteristics in such a model are presented. It is shown how these tools can be employed to simulate the changing contents of main memory; and as a further illustration, the simulation of an auxiliary memory is demonstrated. Graphs are given which show the variation of auxiliary memory performance with the number of associative cells available.

A special purpose multiprogramming system for a computer-controlled telemetry data reduction system

article Free AccessA special purpose multiprogramming system for a computer-controlled telemetry data reduction system Author: Harold R. Gillette Computer Usage Development Corp., Newton Upper Falls, MA Computer Usage Development Corp., Newton Upper Falls, MAView Profile Authors Info & Claims Communications of the ACMVolume 9Issue 7July 1966 https://doi.org/10.1145/365719.366433Published:01 July 1966Publication History 0citation95DownloadsMetricsTotal Citations0Total Downloads95Last 12 Months8Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

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 parallel processing, protecting of separate computations, program debugging, and the sharing among users of memory segments and other computing objects, the names of which are hierarchically structured. The language sophistication contemplated is midway between an assembly language and an advanced algebraic language.

A rapid turnaround multi-programming system

A rapid turnaround multi-programming system

The structure of SYSTEM/360, Part IV: Channel design considerations

Control of I/O operations in a multiprogrammed system involves many complicated functions, such as allocation of facilities and protection against mutual interference among programs. In SYSTEM/360, most responsibilities associated with multiprogramming I/O operations, as well as all device dependent functions, are assigned to the programming system, and channel equipment is designed to operate in conjunction with a supervisory program. Channels permit overlapping of CPU and I/O activity and provide general functions more economically implemented in hardware than in software.

Initial experience with an operating multiprogramming system

Initial experience with an operating multiprogramming system

Problems of storage allocation in a multiprocessor multiprogrammed system

Multiprogramming is defined here as the use of a buffered processor by time-sharing its central control and its memory between two or more object programs under control of an executive system.