Clock synchronization | EPFL Graph Search

Clock synchronization is a topic in computer science and engineering that aims to coordinate otherwise independent clocks. Even when initially set accurately, real clocks will differ after some amount of time due to clock drift, caused by clocks counting time at slightly different rates. There are several problems that occur as a result of clock rate differences and several solutions, some being more acceptable than others in certain contexts. In serial communication, clock synchronization can refer to clock recovery which achieves frequency synchronization, as opposed to full phase synchronization. Such clock synchronization is used in synchronization in telecommunications and automatic baud rate detection. Plesiochronous or isochronous operation refers to a system with frequency synchronization and loose constraints on phase synchronization. Synchronous operation implies a tighter synchronization based on time perhaps in addition to frequency. As a result of the difficulties managing time at smaller scales, there are problems associated with clock skew that take on more complexity in distributed computing in which several computers will need to realize the same global time. For instance, in Unix systems the make command is used to compile new or modified code and seeks to avoid recompiling unchanged code. The make command uses the clock of the machine it runs on to determine which source files need to be recompiled. If the sources reside on a separate and the two machines have unsynchronized clocks, the make program might not produce the correct results. Synchronization is required for accurate reproduction of streaming media. Clock synchronization is a significant component of audio over Ethernet systems. In a system with a central server, the synchronization solution is trivial; the server will dictate the system time. Cristian's algorithm and the Berkeley algorithm are potential solutions to the clock synchronization problem in this environment. In distributed computing, the problem takes on more complexity because a global time is not easily known.

Control upgrade for the TCV coils power supplies

Damien Fasel, Ugo Siravo, Jérémie Dubray, Nicolas Cherix

The Tokamak a` Configuration Variable (TCV) coil converters are fed, during the plasma pulse, by a flywheel generator (FG) providing the AC voltages few seconds before the plasma pulse. The synchronization with the 120 Hz frequency delivered by the FG, var ...

ELSEVIER SCIENCE SA2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Manuel José Ribeiro Vidigueira, Vincent Gramoli, Seth Gilbert

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Real-time monitoring of single-cell secretion with a high-throughput nanoplasmonic microarray

Hatice Altug, Xiaokang Li, Yen-Cheng Liu, Saeid Ansaryan, Eduardo Romero Arvelo

Proteins secreted by cells play significant roles in mediating many physiological, developmental, and pathological processes due to their functions in intra/intercellular communication and signaling. Conventional end-point methods are insufficient for unde ...

2022