Transformations of self-stabilizing algorithms

In this paper, we are interested in transformations of selfstabilizing algorithms from one model to another that preserve stabilization. We propose an easy technique for proving correctness of a natural class of transformations of self-stabilizing algorithms from any model to any other. We present a new transformation of self-stabilizing algorithms from a message passing model to a shared memory model with a finite number of registers of bounded size and processors of bounded memory and prove it correct using our technique. This transformation is not wait-free, but we prove that no such transformation can be wait-free. For our transformation, we use a new self-stabilizing token-passing algorithm for the shared memory model. This algorithm stabilizes in O(n log2 n) rounds, which improves existing algorithms.

[1]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[2]  Danny Dolev,et al.  Shared-memory vs. message-passing in an asynchronous distributed environment , 1989, PODC '89.

[3]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[4]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[5]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[6]  Hagit Attiya,et al.  Sequential consistency versus linearizability , 1994, TOCS.

[7]  Amos Israeli,et al.  Resource Bounds for Self-Stabilizing Message-Driven Protocols , 1997, SIAM J. Comput..

[8]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[9]  Amos Israeli,et al.  Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity , 1990, PODC.

[10]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[11]  Hagit Attiya.  Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract) , 1996, WDAG.

[12]  Hagit Attiya.  Efficient and Robust Sharing of Memory in Message-Passing Systems , 2000, J. Algorithms.

[13]  Shmuel Katz,et al.  Self-stabilizing extensions for meassage-passing systems , 2005, Distributed Computing.

[14]  Kleoni Ioannidou.  Self-stabilizing transformations between message passing and shared memory models , 2001 .

[15]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[16]  Shmuel Katz,et al.  Self-stabilizing extensions for message-passing systems , 1990, PODC '90.