Systems design education: a gaming approach
November 1978 - Vol. 21 No. 11
Features
One of the problems facing managers of computer installations is the problem of configuring the computer system to meet the demands made by the mix of jobs that the…
A simply extended and modified batch environment graphical system (SEMBEGS)
SEMBEGS is a complete batch environment graphical system containing components for handling graphical data files, for displaying the contents of these files on a variety…
Performance evaluation of highly concurrent computers by deterministic simulation
Simulation is presented as a practical technique for performance evaluation of alternative configurations of highly concurrent computers. A technique is described for…
Using synthetic images to register real images with surface models
A number of image analysis tasks can benefit from registration of the image with a model of the surface being imaged. Automatic navigation using visible light or radar…
Computer generation of gamma random variables—II
A rejection method is proposed for generating gamma variates with nonintegral shape parameter &agr;, &agr; > 1. This method is similar to other methods given by…
A simple recovery-only procedure for simple precedence parsers
A simple method is described enabling simple precedence parsers to recover from syntax errors. No attempt to repair errors is made, yet parsing and most semantic…
A note on conditional expressions
Evaluation of a conditional expression may succeed even when the “deciding predicate” diverges and the alternatives are records (or nodes) whose fields have…
Distributed processes: a concurrent programming concept
A language concept for concurrent processes without common variables is introduced. These processes communicate and synchronize by means of procedure calls and guarded…
The new class of Pk trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asympotically grows…
Median split trees: a fast lookup technique for frequently occuring keys
Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains…
Synthesizing constraint expressions
A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of…
On-the-fly garbage collection: an exercise in cooperation
As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is…