Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-03-03
In Proceedings of the Sixth Symposium on Self-Stabilizing Systems (SSS'03), San Francisco, June 2003. See also LNCS 2704
Computer Science
Distributed, Parallel, and Cluster Computing
This is the full and revised version. A previous (obsolete) version appeared as TR2003-1, The Hebrew University of Jerusalem,
Scientific paper
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 Byzantine 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. Pulse synchronization has been previously shown to be a powerful building block for designing algorithms in this severe fault model. We have previously shown how to stabilize general Byzantine algorithms, using pulse synchronization. To the best of our knowledge there is no other scheme to do this without the use of synchronized pulses.
Daliot Ariel
Dolev Danny
Parnas Hanna
No associations
LandOfFree
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-225420