Anthony Ralston
Pages 197-198
Computing machines which directly execute the statements of a high level language have been proposed in the past. This report describes the actual implementation of such a machine: it is a computer whose “machine language” is …
A. Hassitt, J. W. Lageschulte, L. E. Lyon
Pages 199-212
A study is presented of some of the system implications of memory hierarchies in which the backing or secondary store has a very small read time, relative to both the time required for writing and to the read time of conventional …
John G. Williams
Pages 213-222
This paper presents the statistical results of tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations. The arithmetic systems …
H. Kuki, W. J. Cody
Pages 223-230
The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After “closest,” in terms of a metric on the the key space, is suitably defined, three file structures are presented …
W. A. Burkhard, R. M. Keller
Pages 230-236
A method of converting a picture into a “cartoon” or “map” whose regions correspond to differently textured regions is described. Texture edges in the picture are detected, and solid regions surrounded by these (usually broken) …
James P. Strong, Azriel Rosenfeld
Pages 237-246
The behavior of a computer system is largely dependent upon the algorithms employed to allocate the system resources to the processes competing for them. Recent research in time-sharing paging systems has developed the working …
Juan Rodriguez-Rosell, Jean-Pierre Dupuy
Pages 247-253
R. Broucke
Pages 254-256
Subroutine
GCDN, Algorithm 386 as described in [1, 2], computes the greatest common divisor,
IGCD, of
n integers
A(1), … ,
A(
n) by using the Euclidean algorithm to compute first
gcd(
A(1),
A(2)), then
gcd(
gcd(
A(1),
A(2)),
A(3)) …
Larry C. Ragland, Donald I. Good
Page 257
