Markov chain analyses of multiprogrammed computer systems

Most 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.     

Resource allocation for transportation

A linear programming formulation is described that will permit the optimal assignment of transportation resources (vehicles) and movement requirements to a network consisting of a set of designated origins, ports of embarkation, enroute bases, ports of debarkation, and destinations to achieve a prescribed schedule of arrivals.     

Programming the procurement of airlift and sealift forces: A linear programming model for analysis of the least-cost mix of strategic deployment systems

A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used.     

旋转稳定塑料弹体工程设计计算研究

本文以实验结果为依据,首先分析了塑料弹体影响弹丸膛内运动的物理性能,然后结合旋转弹丸的膛内运动特征,经过模拟试验,采用数学拟合法,初步建立旋转稳定弹塑料弹体工程设计计算的数学模型(包括结构尺寸设计计算、强度计算和内弹道计算)。     

New ANSI versions of MIL-STD-414 and MIL-STD-105D

When acceptance sampling plans are applied to measurement characteristics, a choice between application of a variables or an attributes sampling plan must be made. With the recent revision by the American Society for Quality Control for the American National Standards Institute of the ANSI/ASQC Z1.9 variables system and the ANSI/ASQC Z1.4 attributes system, the standards have now been matched so that it is possible to move between them. This article will discuss exploitation of the resulting synergistic relationship to achieve more rational and more effective acceptance sampling.     

Bilateral phase-type distributions

In this article we define a class of distributions called bilateral phase type (BPH), and study its closure and computational properties. The class of BPH distributions is closed under convolution, negative convolution, and mixtures. The one-sided version of BPH, called generalized phase type (GPH), is also defined. The class of GPH distributions is strictly larger than the class of phase-type distributions introduced by Neuts, and is closed under convolution, negative convolution with nonnegativity condition, mixtures, and formation of coherent systems. We give computational schemes to compute the resulting distributions from the above operations and extend them to analyze queueing processes. In particular, we present efficient algorithms to compute the steady-state and transient waiting times in GPH/GPH/1 queues and a simple algorithm to compute the steady-state waiting time in M/GPH/1 queues.     

Landmarks in defense literature

The Profession of Arms: by General Sir John Hackett. Macmillan, New York, 1983. 239 pp.