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.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

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

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More