Herb Grosch
Pages 125-126
Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential …
Philip Clapson
Pages 127-135
The performance of information retrieval systems can be evaluated in a number of different ways. Much of the published evaluation work is based on measuring the retrieval performance of an average user query. Unfortunately, formal …
C. T. Yu, G. Salton
Pages 135-142
This paper presents methods for empirical evaluation of features of Instruction Set Processors (ISPs). ISP features are evaluated in terms of the time used or saved by having or not having the feature. The methods are based on …
Åmund Lunde
Pages 143-153
This paper presents a computationally tractable methodology for including accurately the effects of finite memory size and workload memory requirements in queueing network models of computer systems. Empirical analyses and analytic …
R. M. Brown, J. C. Browne, K. M. Chandy
Pages 153-165
A representation for polygons and polygonal lines is described which allows sets of consecutive sides to be collectively examined. The set of sides are arranged in a binary tree hierarchy by inclusion. A fast algorithm for testing …
Warren Burton
Pages 166-171
Various computations on relations, Boolean matrices, or directed graphs, such as the computation of precedence relations for a context-free grammar, can be done by a practical algorithm that is asymptotically faster than those …
H. B. Hunt, J. D. Ullman, T. G. Szymanski
Pages 171-176
The relationship of internal pricing systems for computer services (chargeout systems) and user management attitudes about their computer-based information systems is investigated. Evidence is provided that the relationship conforms …
Richard L. Nolan
Pages 177-185
A method is presented for evaluating computer system performance in terms of a cost/utilization factor and a measure of imbalance. These coefficients indicate the extent to which the total system cost is effectively utilized. …
Israel Borovits, Philip Ein-Dor
Pages 185-191
“Next-fit” allocation differs from first-fit in that a first-fit allocator commences its search for free space at a fixed end of memory, whereas a next-fit allocator commences its search wherever it previously stopped searching …
Carter Bays
Pages 191-192
Eberhard Bertsch
Pages 192-194
Robert L. Ashenhurst
Pages 198-201
