9 citations found. Retrieving documents...
M. Papatriantafilou, P. Tsigas, " On Self-Stabilizing Wait-Free Clock Synchronization ", Parallel Processing Letters, 7(3), pages 321-328, 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Self-Stabilization In Distributed Systems - A Short Survey - Brzezinski, Szychowiak.. (2000)   (4 citations)  (Correct)

....to dynamic topology reconfiguration. This makes self stabilization an interesting solution for a large number of applications including distributed reset problems (for the most interesting solutions see [3,5] routing and communication protocols ( 7,21, 29,32,44] clock synchronization ([19,22,40,52]) graph theory ( 12,40,41,43,50,57] and others. Since the very first presentation of a self stabilizing algorithm, made by Dijkstra in 1974, progress made in this area has proved that it is one of most important and promising topics of fault tolerance. The goal of this work is to systematize a ....

.... for establishing stabilization properties can be found in [34] Moreover, because in most cases the formal design of stabilizing algorithms and their proofs are very complicated and difficult to follow, a significant attempt to make these tasks less tedious was made by Prasetya and Swierstra [52]. They have developed and applied a set of new operators for the UNITY programming logic [14] a tool for describing properties of distributed algorithms. Their work presents some formal structures and strategies for designing stabilizing distributed algorithms, as well as shows how various formal ....

[Article contains additional citation context not shown here]

M. Papatriantafilou, P. Tsigas, "On self-stabilizing wait-free clock synchronization", Parallel Processing Letters, 7(3), 1997, pp.321-328.


Self-Stabilization Bibliography: Access Guide - Herman (1998)   (2 citations)  (Correct)

....and phase synchronization are natural to consider for research on self stabilization, since synchronization is a fundamental tool for system implementations. Self stabilizing synchronization has been the focus of much recent research [GH90, LZM90, ADG91, CFG92, AKM 93, DW93, CS94, PT94, DW95, HG95, LS95, ER95] 7 Fault Tolerance Dijkstra s initial work on self stabilization [Dij74] mentions no application to fault tolerance. Yet self stabilization is most often seen as a technique for fault tolerance in the area of distributed computing. As such, there has been considerable ....

M Papatriantafilou and P Tsigas. Self-stabilizing wait-free clock synchronization. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Springer-Verlag LNCS 824, pages 267--277, 1994.


Self-Stabilization of Wait-Free Shared Memory Objects - Hoepman, Papatriantafilou (1995)   (4 citations)  Self-citation (Tsigas)   (Correct)

....turn a fault tolerant protocol for the synchronous rounds message passing model into a protocol for the same model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach for combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may ....

Papatriantafilou, M., and Tsigas, P. On self-stabilizing wait-free clock synchronization. In 4th Scandinavian Workshop on Algorithm Theory (  Arhus, Denmark, 1994), Lect. Not. Comp. Sci. 824, Springer Verlag, pp. 267-277.


Self-Stabilization of Wait-Free Shared Memory Objects - Hoepman, Papatriantafilou.. (2002)   (4 citations)  Self-citation (Papatriantafilou Tsigas)   (Correct)

....to turn a fault tolerant protocol for the synchronous rounds message passing model into a protocol for the same model which is both faulttolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [8, 19]. Another approach for combining processor and memory failures is put forward by Afek et al. 2, 3] and Jayanti et al. 14] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving ....

M. Papatriantafilou and P. Tsigas, On self-stabilizing wait-free clock synchronization, in 4th Scandinavian Workshop on Algorithm Theory, Lect. Not. Comp. Sci. 824, Arhus, Denmark, July 1994, Springer Verlag, pp. 267-- 277.


Self-Stabilization of Wait-Free Shared Memory Objects - Hoepman, Papatriantafilou.. (2002)   (4 citations)  Self-citation (Tsigas)   (Correct)

....turn a fault tolerant protocol for the synchronous rounds message passing model into a protocol for the same model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach for combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may ....

Papatriantafilou, M., and Tsigas, P. On self-stabilizing wait-free clock synchronization. In 4th Scandinavian Workshop on Algorithm Theory (  Arhus, Denmark, 1994), Lect. Not. Comp. Sci. 824, Springer Verlag, pp. 267-277. 24


Self-Stabilization of Wait-Free Shared Memory Objects - Jaap-Henk Hoepman Department (1995)   (4 citations)  Self-citation (Papatriantafilou Tsigas)   (Correct)

....turn a fault tolerant protocol for the synchronous rounds message passing model into a protocol for the same model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach to combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may ....

Papatriantafilou, M., and Tsigas, P. On self-stabilizing wait-free clock synchronization. In 4th Scandinavian Workshop on Algorithm Theory ( Arhus, Denmark, 1994), Lect. Not. Comp. Sci. 824, Springer Verlag, pp. 267--277. 24


Linear Time Byzantine Self-Stabilizing Clock Synchronization - Daliot, Dolev, Parnas (2003)   (Correct)

No context found.

M. Papatriantafilou, P. Tsigas, " On Self-Stabilizing Wait-Free Clock Synchronization ", Parallel Processing Letters, 7(3), pages 321-328, 1997.


Linear Time Byzantine Self-Stabilizing Clock Synchronization - Daliot, Dolev, Parnas (2003)   (Correct)

No context found.

M. Papatriantafilou, P. Tsigas, " On Self-Stabilizing Wait-Free Clock Synchronization ", Parallel Processing Letters, 7(3), pages 321-328, 1997.


Self-Stabilization Bibliography: Access Guide - Herman (1998)   (2 citations)  (Correct)

No context found.

M Papatriantafilou and P Tsigas. On self-stabilizing wait-free clock synchronization. Parallel Processing Letters, 7(3):321--328, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC