March 1977 - Vol. 20 No. 3
Features
Improving the access time for random access files
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…
Effective information retrieval using term accuracy
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…
Empirical evaluation of some features of instruction set processor architectures
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…
Memory management and response time
This paper presents a computationally tractable methodology for including accurately the effects of finite memory size and workload memory requirements in queueing…
Representation of many-sided polygons and polygonal lines for rapid processing
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…
Operations on sparse relations
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…
Effects of chargeout on user/manager attitutes
The relationship of internal pricing systems for computer services (chargeout systems) and user management attitudes about their computer-based information systems is…
Cost/utilization: a measure of system performance
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…
A comparison of next-fit, first-fit, and best-fit
“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…