Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
暂无分享,去创建一个
[1] Laura M. Haas,et al. Distributed deadlock detection , 1983, TOCS.
[2] Walter A. Burkhard,et al. Resolution of Deadlocks in Object-Oriented Distributed Systems , 1989, IEEE Trans. Computers.
[3] Mukesh Singhal,et al. Deadlock detection in distributed systems , 1989, Computer.
[4] Mukul K. Sinha,et al. A Priority Based Distributed Deadlock Detection Algorithm , 1985, IEEE Transactions on Software Engineering.
[5] H KohlerWalter,et al. A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution , 1989 .
[6] N. Natarajan,et al. A distributed scheme for detecting communication deadlocks , 1986, IEEE Transactions on Software Engineering.
[7] Shing-Tsaan Huang,et al. A distributed deadlock detection algorithm for CSP-like communication , 1990, TOPL.
[8] K M Chandy,et al. A Distributed Procedure to Detect and/or Deadlock. , 1983 .
[9] Ajay D. Kshemkalyani,et al. Efficient Detection and Resolution of Generalized Distributed Deadlocks , 1994, IEEE Trans. Software Eng..
[10] Donald F. Towsley,et al. A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution , 1989, IEEE Trans. Software Eng..
[11] Ron Obermarck,et al. Distributed deadlock detection algorithm , 1982, TODS.
[12] K. Mani Chandy,et al. A Distributed Graph Algorithm: Knot Detection , 1982, TOPL.
[13] LamportLeslie. Time, clocks, and the ordering of events in a distributed system , 1978 .
[14] Edgar Knapp,et al. Deadlock detection in distributed databases , 1987, CSUR.