On time complexity of distributed algorithms for generalized deadlock detection
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.00 |
The paper addresses the problem of deadlock detection in asynchronous systems for system model that covers unspecified receptions and non-FIFO channels. It presents a hierarchy of deadlock models considered till now, and then abstracts away their differences to define a single, general deadlock model. This model is used to introduce abstract formulation of basic deasdlock detection problems, and to specify distributed algorithm which uniformly addresses deadlock detection problem for various request models. Finally, in this context, termination detection problem is also considered.