About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SIGMOD 1977
Conference paper
A practical deadlock avoidance algorithm for data base systems
Abstract
A new algorithm is presented for avoiding system deadlocks. Because its performance has little dependence on the number of lockable resources, it is particularly well suited to use in data base systems which may have millions of individually lockable records. A further advantage is that both exclusive and shared locking are accommodated. The algorithm is presented in some detail and its performance and functional characteristics discussed.