Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. The simple case of two processors, one performing LISP-like list operations and the other performing garbage collection continuously …
Guy L. Steele
Pages 495-508
This paper develops the multidimensional binary search tree (or
k-d tree, where
k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The
k-d tree …
Jon Louis Bentley
Pages 509-517
This paper deals with the development of a mathematical model for and the digital simulation in Fortran IV of phytoplankton and zooplankton population densities in a river using previously developed rate expressions. In order …
R. Mark Claudson
Pages 517-523
Determining a policy for efficient allocation and utilization of a set of disk drives with differing operational characteristics is examined using analytical techniques. Using standard queueing theory, each disk drive is characterized …
William F. Piepmeier
Pages 524-527
One means of analyzing program performance is by deriving closed-form expressions for their execution behavior. This paper discusses the mechanization of such analysis, and describes a system, Metric, which is able to analyze …
Ben Wegbreit
Pages 528-539
Pages 544-546
Mark Laventhal, Bill Mark, Gretchen Brown, Dave Ellis, Andy Huber
Page 494
