F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3(3):146--158, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Elastic Vector Time - Fetzer, Raynal (2003) (Correct)
.... do this, we require that action s be waiting for to be executed first (see Figure 8) 3 Implementation In Timed Asynchronous Systems We sketch how to implement elastic vector time in timed asynchronous systems [4] with hardware watchdogs and an externally synchronized clocks (e.g. see [3]) The hardware watchdogs permit the implemention of a perfect fail [ a) Action A : wait [ qcH eA cH 8e )h Figure 8. Application program based on elastic vector time ure detector [5] i.e. all crashed processes are eventually suspected and no ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146-158, 1989.
The Timely Computing Base: Timely Actions in the.. - Veríssimo.. (2000) (1 citation) (Correct)
....of distributed durations is done differently. Given that we do not assume the existence of synchronized clocks, the methodology for measuring a distributed duration, that is, for relating timestamps of events in different sites, relies on the well known round trip duration measurement technique[7], which is for the matter an implicit clock synchronization action. Distributed durations are often associated to the measurement of message delivery delays. A send and a deliver event bound the measured duration. This technique produces an error associated to each measurement whose value is ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3(3):146--158, 1989.
Rejuvenation and Failure Detection in Partitionable Systems - Fetzer, Högstedt (2001) (Correct)
....are in transit. We assume that the execution of an event takes zero time. Practically, this means that we add the processing time to the transmission delay of messages. Each process has a clock . In this paper we assume the clocks to have no drift and to be perfectly synchronized (see [1] for techniques to synchronize clocks) For simplicity, we assume that all processes start at time start. Furthermore, we assume there is a mechanism to rejuvenate a gateway, and that it is likely that a gateway resumes forwarding packets within (boot time) time units after a rejuvenation. An ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
The Timed Asynchronous Distributed System Model - Cristian, Fetzer (1999) (78 citations) Self-citation (Cristian) (Correct)
....model adequately describes existing distributed systems built from networked workstations. In contrast with the time free model, the timed model allows practically needed distributed services such as clock synchronization, membership, consensus, election, and atomic broadcast to be implemented [4], 10] 14] 6] 13] Since it does not assume the existence of hardware clocks or timed services, the time free model may appear to be more general than the timed model. However, all workstations currently on the market have high precision quartz clocks, so the presence of clocks in the timed ....
....are specified using realtime constraints. For example, if a component fails, then within time units the application has to perform some action. Hardware clocks allow one to implement application level timeouts . The timed asynchronous system model was introduced (without being named) in [4]. It was further refined in [10] and renamed to avoid confusion with the time free model [21] In particular, 10] introduces system stability predicates and conditional timeliness properties to capture the intuition that as long as the system is stable, that is, the number of failures affecting ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Lower Bounds for Function Based Clock Synchronization - Fetzer, Cristian (1995) (3 citations) Self-citation (Cristian) (Correct)
....the messages over a long interval of time reducing network contentions [2] Second, agreeing approximately on the value of faulty clocks introduces a communication and processing overhead which can be avoided in convergence function based algorithms. Third, the use of probabilistic clock reading [1] allows to reduce the maximum deviation of convergence function based algorithms below the deviation achievable by broadcast based algorithms. When using a probabilistic clock reading method, there exists a small probability that a correct process cannot approximate a remote clock with an error of ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Fail-Awareness: An Approach to Construct Fail-Safe Systems - And (1997) Self-citation (Cristian) (Correct)
....to their safe state. We review some of the mechanisms we use to detect performance failures and to implement indicators. 5. 1 Fail Aware Datagrams The fail aware datagram service [13] calculates upper bounds on the transmission delays of one way messages by using round trip delay measurements [1]. For example, to compute an upper bound on the transmission of , it uses the four time stamps B m C D A (C B) td(m) q p D local (hardware clock) time local (hardware clock) time n Figure 12: When the drift rate of hardware clocks can be neglected, the transmission delay of can be ....
....us to either force only the servers of a majority partition to make progress, or to force servers to make progress even when they are in a minority partition. A service that can be viewed as an early example of a fail aware service is the probabilistic clock synchronization service proposed in [1] for timed asynchronous systems: that service has a Boolean variable synchronized , that is true only when a clock is synchronized and is false when the clock may be out of synch. 10 Conclusion The guaranteed response paradigm [18] which aims at guaranteeing timely responses, depends on the ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Using Fail-Awareness to Design Adaptive Real-Time Applications. - Christof Fetzer And (1997) (2 citations) Self-citation (Cristian) (Correct)
....is at most . If access to external time is available, and all clocks in are synchronized within = of real time, Fortress ensures that 2 8td for each process in . In other words, Fortress tries to provide one common time base whenever possible. We use an improved probabilistic [6, 1] approach for synchronizing clocks, which guarantees that the clock synchronization service is fail aware: when the clock synchronization server of some process cannot guarantee that is within of the other clocks in , it makes sure that process leaves , i.e. that is s ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
On the Possibility of Consensus in Asynchronous Systems - Fetzer, Cristian (1995) (17 citations) Self-citation (Cristian) (Correct)
.... model to allow deterministic implementations for these basic distributed services [9, 10, 1] This paper investigates under which conditions leader election and consensus services can be implemented in the timed asynchronous system model, a model that has been implicitly in use for some time (e.g. [3]) was named in [8] and is formally defined in [7] We call conditions which restrict the pace of the processes and the transmission delay of messages progress assumptions. Several progress assumptions are reasonable to investigate for timed asynchronous systems. In this paper we focus on always ....
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Synchronization in Massive Multiplayer - Online Games Stefano (Correct)
No context found.
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3(3):146--158, 1989.
Global Synchronization in Sensornets - Richard Karp Jeremy (Correct)
No context found.
Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Adaptive Clock Synchronization in Sensor Networks - Santashil Palchaudhuri Santa (2004) (Correct)
No context found.
Cristian, F.: Probabilistic Clock Synchronization. Distributed Computing 3 (1989) 146--158
Gossip-Based Clock Synchronization for Large.. - Iwanicki, van Steen.. (2006) (Correct)
No context found.
Cristian, F.: Probabilistic clock synchronization. Distributed Computing 3 (1989) p.146--158
Time Synchronization and Calibration in Wireless Sensor.. - Römer, Blum, Meier (Correct)
No context found.
Flaviu Cristian. Probabilistic clock synchronization. Journal of Distributed Computing, 3:146--158, 1989.
A RIO-like Technique for Interactivity Loss - Avoidance In Fast-Paced (Correct)
No context found.
Cristian F. 1989. "Probabilistic clock synchronization", Distributed Computing, vol.3, no.3, pp.146-158.
A RIO-like Technique for Interactivity Loss.. - Palazzi.. (2004) (Correct)
No context found.
Cristian F. 1989. "Probabilistic clock synchronization", Distributed Computing, vol.3, no.3, pp.146-158.
Multimedia Tools and Applications, 14, 23--53, 2001 c - Design And Experimental (2001) (Correct)
No context found.
F. Cristian, "Probabilistic clock synchronization," Distributed Computing' Vol. 3, pp. 146--158, 1989.
Global Clock Synchronization in Sensor Networks - Li, Rus (2004) (6 citations) (Correct)
No context found.
Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
Fault Tolerance in Fixed-Priority Hard Real-Time Distributed Systems - Lima (2003) (Correct)
No context found.
F. Cristian. "Probabilistic Clock Synchronization". Distributed Computing, 3:146-- 158, 1989.
Automatic Performance Analysis on Parallel Computers with SMP Nodes - Wolf (2002) (1 citation) (Correct)
No context found.
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1998. Springer Verlag.
Global Synchronization in Sensornets - Richard Karp Jeremy (Correct)
No context found.
Flaviu Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146--158, 1989.
A Secure and Scalable Digital Time-stamping Service - Tulone (Correct)
No context found.
F.Cristian. Probabilistic clock synchronization. Distributed Computing 3(3), pp. 146-158, 1989.
Adaptive Synchronisation for a RoboCup Agent - Montgomery, Mackworth (Correct)
No context found.
F. Cristian. Probabilistic Clock Synchronization. Distributed Computing 3:146-158. 1989.
Measuring Distributed Durations with Stable Errors - Casimiro, Martins.. (2001) (1 citation) (Correct)
No context found.
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3(3):146--158, 1989.
Precise and Low-Jitter Wireless Time Synchronization - Blum, Thiele (2003) (Correct)
No context found.
Flaviu Cristian. Probabilistic clock synchronization. Journal of Distributed Computing, 3:146--158, 1989.
Uncertainty and Predictability: Can they be reconciled? - Verissimo (Correct)
No context found.
3 Cristian, F.: Probabilistic Clock Synchronization. Distributed Computing, Springer Verlag 1989 (1989)
First 50 documents Next 50
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