loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
5th IEEE Workshop on Future Trends of Distributed Computing Systems
Deadlocks in Distributed Systems: Request Models and Definitions
Chenju, Korea
August 28-August 30
ISBN: 0-8186-7125-4
Jerzy Brzezinski, Poznan University of Technology
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.
Index Terms:
Deadlock models, distributed algorithms, distributed deadlock detection, message communication systems
Citation:
Jerzy Brzezinski, Jean-Michel Helary, Michel Raynal, "Deadlocks in Distributed Systems: Request Models and Definitions," ftdcs, pp.0186, 5th IEEE Workshop on Future Trends of Distributed Computing Systems, 1995
Usage of this product signifies your acceptance of the Terms of Use.