|Title:||A New Characterization of Distrlbuted Deadlock in Database
|Abstract:||The problem of distributed transactions deadlock is analyzed from a new point of view. Consequently we are able to obtain three results. The first is a sufficient condition for deadlock freedom of transactions. The second establishes how many syntactically identical transactions must be analyzed to determine their freedom from deadlock. The third extends the Havender scheme () for deadlock, prevention (locking entities in a fixed order) to the distributed case.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0424), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion