Anthony Ralston
Page 126
A general method of constructing a drive workload representative of a real workload is described. The real workload is characterized by its demands on the various system resources. These characteristics of the real workload are …
K. Sreenivasan, A. J. Kleinman
Pages 127-133
A probabilistic model of a multiprogramming system is exercised in order to determine the conditions under which the dynamic repacking of main memory is beneficial. An expression is derived for the maximum interference that a …
E. Balkovich, W. Chiu, L. Presser, R. Wood
Pages 133-138
When the amount of space required for file storage exceeds the amount which can be kept online, decisions must be made as to which files are to be permanently resident and which mountable. These decisions will affect the number …
Howard Lee Morgan
Pages 139-142
T. Wright
Pages 152-155
Thomas Wright
Pages 152-157
Raster scan computer graphics with “real time” character generators have previously been limited to alphanumeric characters. A display has been described which extends the capabilities of this organization to include general
…
R. C. Barrett, B. W. Jordan
Pages 157-163
It has previously been claimed [1 and 2] that the quadratic hash table search method of Maurer cannot usefully be applied to tables of size 2
n. This is not so; the method can in fact be applied to tables of size
pn for any prime …
A. Frank Ackerman
Page 164
I had hoped that Moorer's rebuttal to my short communication in the November 1972 Communications would close the debate on a topic which, like the computer itself, has provoked an inordinately large quantity of unqualified argument …
Stephen W. Smoliar
Pages 164-165
Harold S. Stone
Pages 165-166
Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to
…
Fred T. Krogh
Pages 167-169
CORPORATE CACM Staff
Pages 175-176
Detailed performance evaluations are presented for six ACM algorithms:
quicksort (No. 64),
Shellsort (No. 201),
stringsort (No. 207), “
TREESORT3” (No. 245),
quickersort (No. 271), and
qsort (No. 402). Algorithms 271 and 402 are …
Rudolf Loeser
Pages 143-152
