Self-stabilizing pulse synchronization inspired by biological pacemaker networks

Authors:
Ariel Daliot;Danny Dolev;Hanna Parnas
Affiliations:
School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel;School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel;Department of Neurobiology and the Otto Loewi Minerva Center for Cellular and Molecular Neurobiology, Institute of Life Science, The Hebrew University of Jerusalem, Israel
Venue:
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Year:
2003

Citing 13
Cited 10

Reaching approximate agreement in the presence of faults

Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems

Distributed Computing
On the possibility and impossibility of achieving clock synchronization

Journal of Computer and System Sciences
Synchronization of pulse-coupled biological oscillators

SIAM Journal on Applied Mathematics
Practical uses of synchronized clocks in distributed systems

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Dynamic fault-tolerant clock synchronization

Journal of the ACM (JACM)
Stabilizing phase-clocks

Information Processing Letters
Pulse-coupled decentral synchronization

SIAM Journal on Applied Mathematics
Computer networks (3rd ed.)

Computer networks (3rd ed.)
Self-stabilization

Self-stabilization
Phase Clocks for Transient Fault Repair

IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms

Distributed Algorithms
Understanding Protocols for Byzantine Clock Synchronization

Understanding Protocols for Byzantine Clock Synchronization

Self-stabilizing clock synchronization in the presence of Byzantine faults

Journal of the ACM (JACM)
Self-stabilizing byzantine agreement

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A theoretical evaluation of peer-to-peer internal clock synchronization

Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Self-stabilizing Byzantine digital clock synchronization

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A Byzantine-fault tolerant self-stabilizing protocol for distributed clock synchronization systems

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
An adaptive coupling-based algorithm for internal clock synchronization of large scale dynamic systems

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilization of byzantine protocols

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Fast computation by population protocols with a leader

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems. Pulse-coupled synchronization is a phenomenon displayed by a large variety of biological systems, typically overcoming a high level of noise. Inspired by such biological models, a robust and self-stabilizing pulse synchronization algorithm for distributed computer systems is presented. The algorithm attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently. We propose that pulse synchronization algorithms can be suitable for a variety of distributed tasks that require tight synchronization but which can tolerate a bound variation in the regularity of the synchronized pulse invocations.