S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision and Graceful Degradation," in Proc. Fourth ACM Symp. Principles of Distributed Computing, pp. 237--249. ACM Press, New York, 1985.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....contrast, fault tolerant clock synchronization algorithms driven by multiple clock sources can be implemented at little additional cost in distributed systems. Fault tolerant clock synchronization algorithms can be classified into the following categories: interactive convergence [1] 2] 3] [4], 5] 6] 7] distributed agreement [3] clock server [8] and interval [9] algorithms. Interactive convergence algorithms are suitable for a large class of applications, providing fully distributed, fault tolerant clock synchronization among nodes which exhibit equal functionality as far as ....

....reasons, this paper focuses on interactive convergence algorithms only. Some examples of interactive convergence algorithms are FTMA (Fault Tolerant Midpoint Algorithm) 1] FTAA (FaultTolerant Average Algorithm) 2] CNVA (Interactive Convergence Algorithm) 3] FCA (Fast Convergence Algorithm) [4] and SWA (Sliding Window Algorithm) 7] 11] In an interactive convergence algorithm, processors periodically exchange resynchronization messages containing their clock values 3 . Such a process occurs regularly during a period of duration T int seconds, which is referred to as a ....

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision, and Graceful Degradation," Proceedings of the 4th ACM SIGACT-SIGOPS Symposium on Principles in Distributed Computing, August 1985, pp. 237-249.

....process (TSP) periodically reads some or all of the clocks in the system, and computes a clock correction term using a fault tolerant averaging convergence function. Examples of ICV algorithms include the original interactive convergence algorithm (CNVA) 12] the fast convergence algorithm (FCA) [18], the fault tolerant average algorithm (FTAA) 7, 11] the fault tolerant midpoint algorithm (FTMA) 7, 37] the differential fault tolerant midpoint algorithm (DFTMA) 4] and the sliding window algorithm (SWA) 23] We refer to these algorithms as unistep ICV algorithms, because in each round a ....

.... (TCID) partial non relay (or local) clock information dissemination (LCID) and partial with relay clock information dissemination (PCID) TCID is the communication model used by most ICV algorithms, i.e. the clock value of a correct TSP is read by every other correct TSP in the system [4, 11, 12, 18, 23, 37]. The cost of implementation of such a model depends considerably on whether the nodes communicate via a completely connected network (CCN) or a not completely connected network (NCCN) The TCID model can be implemented with broadcast protocols, which employ relay nodes in the case of NCCN ....

[Article contains additional citation context not shown here]

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision, and Graceful Degradation," Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, August 1985, pp. 237249.

....in measuring the time cost imposed by the wait free property, as measured in terms of extra computation time in the most normal (failure free) case. In this paper, we address the general question by considering a specific problem the approximate agreement problem studied, for example, in [16, 20, 21, 37]; we study this problem in the context of a particular shared memory primitive single writer multi reader atomic registers. In this problem, each process starts with a real valued input, and (provided it does not fail) must eventually produce a real valued output. The outputs must all be within ....

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision, and Graceful Degradation," in proceedings of the 4th ACM Symp. on Principles of Distributed Computing, 1985, pp. 237--249.

....ICV time server process (TSP) periodically reads some or all of the clocks in the system, and computes a clock correction term using a fault tolerant averaging convergence function. Examples of convergence functions include the original interactive convergence (CNV) 16] the fast convergence (FC) [22], the fault tolerant average (FTA) 8, 14] the fault tolerant midpoint (FTM) 8, 43] the differential fault tolerant midpoint (DFTM) 4] and the sliding window (SW) 28] convergence functions. To date, these convergence functions have been used only in association with unistep ICV algorithms. ....

.... (or local) clock information dissemination (LCID) and partial with relay clock information dissemination (PCID) Total clock information dissemination (TCID) This is the communication model used by most ICV algorithms, i.e. a correct TSP reads the clocks of every correct TSP in the system [4, 14, 16, 22, 28, 43]. The cost of implementing this model depends considerably on whether the nodes communicate via a completely connected network (CCN) or a not completely connected network (NCCN) The TCID model can be implemented with broadcast protocols, which employ relay nodes in the case of NCCN systems. ....

[Article contains additional citation context not shown here]

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision, and Graceful Degradation," Proceedings of the 4th Symposium on Principles of Distributed Computing, pp. 237--249, 1985.

No context found.

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision and Graceful Degradation," in Proc. Fourth ACM Symp. Principles of Distributed Computing, pp. 237--249. ACM Press, New York, 1985.

No context found.

S. Mahaney and F. Schneider, "Inexact Agreement: Accuracy, Precision and Graceful Degradation," Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, August 1985, pp. 237-249.

No context found.

S. Mahaney and F. Schneider, "Inexact agreement: accuracy, precision and graceful degradation," Proc. of the Fourth ACM Symp. on Principles of Distributed Computing, 1985, pp. 237--249.

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