Papers for CS575

1.Distributed Snapshots: Determining Global States of Distributed Systems, Chandy and Lamport, ACM Transactions on Computer Systems, vol.3,no.1,February1985,pp.63-75 pdf

2. Distributed Computation on Graphs: Shortest Path Algorithms, Chandy and Misra, Communications of the ACM, November, 1982, vol.25, no 11, pp. 833-837. pdf

3. An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection, Chandy and Misra, ACM TOPLAS, July 1986, pp. 326-343. pdf

4. On Distributed Snapshots, Lai, Yang, Information Processing Letters 25(1987), pp. 153-158. pdf

5. Time, Clocks and the Ordering of Events in a Distributed System, Lamport, Communications of the ACM, July 1978, Vol. 21, No. 7, pp.558-565. pdf

6. Efficient Distributed Snapshots, Spezialetti, Kerns, International Confernec on Distributed Computing Systems, Cambridge, Mass., May 19-23, 1986, IEEE Computer Society.

7. Logical Time: Capturing Causality in Distributed Systems, Raynal and Singhal, IEEE Computer, February, 1996, pp. 49-56. pdf

8.A Distributed Graph Algorithm: Knot Detection, Misra and Chandy, ACM Transactions on Programming Languages and Systems, vol.4, no.4, October 1982, pp. 678-686. pdf

9. Distributed Deadlock Detection, Chandy and Misra, ACM Transactions on Computer Systems, vol.1, no. 2, May, 1983. pdf

10. A Distributed Solution of the Distributed Termination Problem, Rana, Information Processing Letters, 17, 1983, pp. 43-36. pdf

11. Derivation of a Termination Detection Algorithm for Distributed Computations, Dijkstra, Feijen, can Gasteren, Information Processing Letters, 16, a983, pp. 217-219. pdf

12. Termination Detection for Diffusing Computations, Infomation Processing Letters 11 (1), 1980-1-4. pdf

13. Detecting Termination of Distributed Computations Using Markers, Misra pdf

14. Election and Mutual Exclusion Algorithms pdf

15. Efficient Algorithms for Distributed Snapshots and GVT Approximation pdf

16. An Example of Stepwise Refinement of Distributed Programs: Quiescence detection pdf