This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
May 1987 (vol. 13 no. 5)
pp. 540-552
S. Katz, Department of Computer Science, Technion
Parallel distributed algorithms are presented for adding and deleting edges in a directed graph without creating a cycle. Such algorithms are useful for a variety of problems in distributed systems such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are numerous possible interactions among overlapping instances of the algorithms.
Index Terms:
distributed systems, Concurrent programming
Citation:
S. Katz, O. Shmueli, "Cooperative Distributed Algorithms for Dynamic Cycle Prevention," IEEE Transactions on Software Engineering, vol. 13, no. 5, pp. 540-552, May 1987, doi:10.1109/TSE.1987.233199
Usage of this product signifies your acceptance of the Terms of Use.