Showing papers in "Ibm Systems Journal in 1965"
TL;DR: An algorithm is given for computer control of a digital plotter that may be programmed without multiplication or division instructions and is efficient with respect to speed of execution and memory utilization.
Abstract: An algorithm is given for computer control of a digital plotter.
The algorithm may be programmed without multiplication or division instructions and is efficient with respect to speed of execution and memory utilization.
2,257 citations
TL;DR: The frequency of the various shifts for floating-point additions with different radices was derived from the basic data so that designs with various redices may be evaluated.
Abstract: This paper analyzes the addition operation of floating-point systems.
The analysis of a million executed floating-point additions is presented as an aid in optimizing design and measuring performance.
The frequency of the various shifts for floating-point additions with different radices was derived from the basic data so that designs with various redices may be evaluated.
48 citations
TL;DR: Significant improvements in the modeling capability and storage flexibility of the General Purpose Systems Simulator are described in this paper.
Abstract: Significant improvements in the modeling capability and storage flexibility of the General Purpose Systems Simulator are described in this paper.
Increased versatility and ease of use as well as new debugging aids are also discussed.
The additions and changes to the simulator are illustrated by examples.
25 citations
TL;DR: Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming, and computational considerations are discussed.
Abstract: Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed.
17 citations
TL;DR: The main purpose of the paper is to review a number of typical methods of meeting the expanding need for dynamic program relocation in the context of selected computer systems for tutorial concreteness.
Abstract: A general statement of the problem of dynamic program relocation is presented as an aid in describing specific relocation principles.
The main purpose of the paper is to review a number of typical methods of meeting the expanding need for dynamic program relocation. Although no attempt is made at evaluation, the methods are discussed in the context of selected computer systems for tutorial concreteness.
15 citations
TL;DR: A queuing model that analyzes the capabilities of a low speed data channel for real-time data inputs and yields estimates of waiting, service, and overall transit times is developed.
Abstract: This paper develops a queuing model that analyzes the capabilities of a low speed data channel for real-time data inputs. The model yields estimates of waiting, service, and overall transit times.
Low speed channel throughput can be increased by multiplexing low speed devices. It is assumed that the multiplexing operation employs common registers, the contents of which are saved at initiation and restored at completion of service for all outstanding requests. The model takes into account preemptive interference from high speed data channels.
8 citations
TL;DR: This paper discusses a compiler Organization in which phases act sequentially on a source program held in core storage, using the 1401 FORTRAN compiler to illustrate the general scheme.
Abstract: This paper discusses a compiler Organization in which phases act sequentially on a source program held in core storage.
A brief description of each phase of the 1401 FORTRAN compiler is given to illustrate the general scheme.
6 citations
TL;DR: The reliability aspects of polymorphic systems are examined within the confines of a simple failure and repair model and the derivation and use of easy-to-calculate approximations to the unavailabilities of system capacity levels are emphasized.
Abstract: The reliability aspects of polymorphic systems are examined within the confines of a simple failure and repair model.
Emphasized are the derivation and use of easy-to-calculate approximations to the unavailabilities of system capacity levels.
5 citations
TL;DR: Procedures for program testing associated with implementation of a large complex real-time system are discussed step by step and testing both in a simulated environment and in real time.
Abstract: Procedures for program testing associated with implementation of a large complex real-time system are discussed step by step.
The discussion includes testing both in a simulated environment and in real time.
Final testing and monitoring of system performance are also briefly considered.
5 citations
TL;DR: Algorithms for the design of traffic-signal progressions for fixed-time control using least-squares and minimax fits are described, reducing the initial design time considerably and leading to solutions that are superior to manually derived designs.
Abstract: Algorithms for the design of traffic-signal progressions for fixed-time control are described.
Least-squares and minimax fits are used to derive solutions for given volume requirements within specified limits of speed and cycle time.
The algorithms have been programmed for processing on a digital computer, thus reducing the initial design time considerably and leading to solutions that are superior to manually derived designs.
5 citations
TL;DR: This discussion presents a unified method for organizing the configuration data of manufacturing files, and for generating and retrieving essential quantities from the files, with the aid of matrix algebra.
Abstract: This discussion presents a unified method for organizing the configuration data of manufacturing files, and for generating and retrieving essential quantities from the files. The required processing operations, which include various requirements and engineering change computations, are explained with the aid of matrix algebra.
An important objective of the method is to permit a reasonably optimal balance between the bulk-storage requirenaents and the amount of time required for processing.
TL;DR: Formulated in terms of mathematical programming, the economic and mathematical facets of production planning are discussed and a feasible computation technique is suggested.
Abstract: In many industries, production planning involves the allocation of various resources in the joint production of similar products. Inventory levels, labor decisions, and an economic choice of lot sizes are all influential in the planning process.
Formulated in terms of mathematical programming, the economic and mathematical facets of production planning are discussed. A feasible computation technique is suggested.
TL;DR: An experimental system for the kinematic analysis of two- and three-dimensional mechanical linkage is outlined, as are the basic vector equations used in obtaining solution for position, velocity, acceleration, and force of linkage elements.
Abstract: An experimental system for the kinematic analysis of two- and three-dimensional mechanical linkage is outlined.
The structure of the programmed system, the input language, and the method of storage allocation are described.
The class of problems treated by the system is discussed in brief, as are the basic vector equations used in obtaining solution for position, velocity, acceleration, and force of linkage elements.
TL;DR: The structure and use of an interpretive program for matrix operations is treated and the system provides automatic storage allocation for external disk storage as well as for core memory.
Abstract: The structure and use of an interpretive program for matrix operations is treated.
The discussion emphasizes the nature of the programming language and the method of storage allocation. The system provides automatic storage allocation for external disk storage as well as for core memory.
TL;DR: The sequencing of several project networks on limited facilities is discussed under the assumption that the projects and resources have already been specified by a higher scheduling junction and are then converted into a network on which useful alterations can be made.
Abstract: The sequencing of several project networks on limited facilities is discussed under the assumption that the projects and resources have already been specified by a higher scheduling junction.
A priority function is proposed which uses both the local and global properties of the project network.
The resulting schedule is then converted into a network on which useful alterations can be made.
TL;DR: This document adapts the sequencing control reported in Part V of this paper to individual plant requirements and goals to relate measures of plant performance to certain control parameters.
Abstract: This document adapts the sequencing control reported in Part V of this paper to individual plant requirements and goals.
A regression model is used to relate measures of plant performance to certain control parameters. This relationship is periodically recomputed using statistical analysis of operational data.
A pertinent decision rule is derived by optimal control theory.
TL;DR: This paper describes a control technique for regulating the waiting times of jobs in a discrete manufacturing process based on the second method of Lyapunov, which has been extensively used for deterministic processes.
Abstract: This paper describes a control technique for regulating the waiting times of jobs in a discrete manufacturing process.
The technique is based on the second method of Lyapunov, which has been extensively used for deterministic processes. Two illustrations of the method are included.
Experimental evidence of the effectiveness of the technique is indicated.
TL;DR: An approach to the preparation and evaluation of preliminary plans for a discrete manufacturing enterprise is outlined and Mathematical techniques applicable to the solution of these problems are discussed.
Abstract: An approach to the preparation and evaluation of preliminary plans for a discrete manufacturing enterprise is outlined.
Some major data processing problems arise in this type of long-range planning. Mathematical techniques applicable to the solution of these problems are discussed.