Research and Advances

Garbage collection for virtual memory computer systems

In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.

Advertisement

Author Archives

Research and Advances

A note on data base deadlocks

In “Synchronization in a Parallel-Accessed Data Base” [Comm. ACM 12, 11 (Nov. 1969), 604-607] A. Shoshani and A. J. Bernstein have given a very lucid synthesis of diverse techniques to assure the integrity of a data base. But it appears that one of the factors in the synthesis, the entry hold count, will prevent the return of a node to the free list in precisely those circumstances for which they invoked the facility.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved