MARZULLO, K. Maintaining the time in a distributed system. An example of a loosely-coupled distributed service. Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ., Stanford, Calif., 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to uncertainty in propagation delays. Employing radio receivers to inject such correct real times into a distributed system is one way to provide the needed source of time. Algorithms for clock synchronization when an extemal source of time is available are described in [Marzullo Owicki 83] Marzullo 84] and [Lamport 85] The fact that so many clock synchronization algorithms can be viewed in terms of a single para digm was a surprise. Previously, clock synchronization algorithms were viewed in terms of three classes: those based on convergence, those based on agreement, and those in the ....

Marzullo, K. Maintaining the time in a distributed system. An example of a loosely-coupled distributed service. Ph.D. Thesis, Department of Electrical Engineering, Stanford University.

....with the NTI, cf. Sch95] and [SS95] 2 2 Interval based Clock Synchronization Interval based clock synchronization introduced in [Sch94] and further developed in a number of papers [SS97] Scho97] Sch97b] Sch97c] etc. relies on the interval based paradigm originally introduced in [Mar84] and [Lam87] Real time t (usually UTC) is not just represented by a single time dependent clock value C(t) here, but rather by an accuracy interval A(t) that must satisfy t 2 A(t) As illustrated in Figure 1, accuracy intervals are usually provided by combining an ordinary clock C(t) with a ....

K. Marzullo. Maintaining the time in a distributed system. An example of a looselycoupled distributed service, PhD thesis, Department of Electrical Engineering, Stanford University, February 1984.

....along with the system assumptions, which are all expressed by intervals. Section 4 contains the construction of our algorithm including an evaluation by using discrete event simulation. 3. Background Our clock synchronization approach relies on an interval based paradigm inspired by [8] and [4] We use bold letters like I to denote an ordinary interval I = x; y] x y, with lower and upper edge x and y, respectively. An (ordered) set of intervals is denoted by a calligraphic bold letter like I . Moreover, a distinguished reference point I partitions the interval into a negative ....

....consider effects due to clock granularity and discrete rate adjustments, see [12] for an extension. In addition we define uniform bounds ae max = max p fae Gamma p ; ae p g and oe max = max p foe p g. 3.2. Accuracy and Rate Intervals The idea of the interval based approach introduced in [8] is to represent time information by an accuracy interval A p (t) In practice, such intervals are maintained by an ordinary clock C p (t) in conjunction with a time dependent interval ff p (t) Gammaff Gamma p (t) ff p (t) of accuracies taken relatively to the clock s value, hence A ....

[Article contains additional citation context not shown here]

K. Marzullo. Maintaining the time in a distributed system. An example of a loosely-coupled distributed service. PhD thesis, Department of Electrical Engineering, Stanford University, February 1984.

No context found.

MARZULLO, K. Maintaining the time in a distributed system. An example of a loosely-coupled distributed service. Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ., Stanford, Calif., 1984.

No context found.

Marzullo, K. Maintaining the time in a distributed system. An example of a loosely-coupled distributed service. Ph.D. Thesis, Department of Electrical Engineering, Stanford University.

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