Deadlock-free Sharing of Resources in Asynchornous Systems

Abstract

Whenever resources are shared among several activities that hoard resources, the activities can attain a state of deadlock in which, for lack of resources, none of the activities can proceed. Deadlocks can be prevented by coordination of the sharing. efficient running of the activities under such coordination requires knowledge of the patterns of use of resources by the activities.