Jean E. Sammet
Page 310
Orrin E. Taulbee, Sam D. Conte
Pages 311-313
This paper consolidates a number of popular rules of thumb which have been suggested for the design of record addressing algorithms, and discusses the applicability of these rules to large commercial databases. Guidelines for …
Dennis Severance, Ricardo Duhne
Pages 314-326
This paper analyzes the memory interference caused by several processors simultaneously using several memory modules. Exact results are computed for a simple model of such a system. The limiting value is derived for the relative …
Forest Baskett, Alan Jay Smith
Pages 327-334
An algorithm is presented for the assignment of instruction addresses and formats under the following conditions: (1) the length of the instruction varies as a function of the distance of the instruction from its target; (2)
…
Gideon Frieder, Harry J. Saal
Pages 335-338
An edge reference into a list structure is a pair of pointers to adjacent nodes. Such a reference often requires little additional space, but its use can yield efficient algorithms. For instance, a circular link between the ends …
David S. Wise
Pages 338-342
Previous approaches to the problem of automatically converting decision tables to computer programs have been based on decomposition. At any stage, one condition is selected for testing, and two smaller problems (decision tables …
Helmut Schumacher, Kenneth C. Sevcik
Pages 343-351
Douglas W. Clark
Pages 352-356
Pages 361-363
