2,377 Hits in 4.4 sec

Practically-Self-Stabilizing Vector Clocks in the Absence of Execution Fairness [article]

Iosif Salem Chalmers University of Technology)
2017 arXiv   pre-print
The novelty is that in the absence of execution fairness, the algorithm guarantees a bound on the number of times in which the system might violate safety (while existing algorithms might block forever  ...  We present the first, to the best of our knowledge, stabilizing vector clock algorithm for asynchronous crash-prone message-passing systems that can recover in a wait-free manner after the occurrence of  ...  3) the system to be practically-self-stabilizing (without fair scheduling).  ... 
arXiv:1712.08205v1 fatcat:u5jrxmkjjnfwdijgbgqxpgyvi4

Clocked Population Protocols

James Aspnes
2017 Proceedings of the ACM Symposium on Principles of Distributed Computing - PODC '17  
., corresponding to clock ticks, the protocol switches to a limit of previous configurations supplemented by an signal registering in an extra component in some of the agents' states.  ...  Using transfinite times means that we can represent fairness over sequences of transitions that may include clock ticks with the same definition as over smaller intervals.  ...  ACKNOWLEDGMENTS I would like to thank the anonymous referees for their helpful comments, including a suggestion to consider in more detail direct simulations of absence detectors, a topic not examined  ... 
doi:10.1145/3087801.3087836 dblp:conf/podc/Aspnes17 fatcat:ao2o3h6avrhwrcxnllx6uzdy4i

Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks [article]

Shlomi Dolev, Thomas Petig, Elad Michael Schiller
2018 arXiv   pre-print
Our self-stabilizing algorithm uses a bounded storage during asynchronous executions (that are not necessarily fair).  ...  Since the recovery period is bounded and the occurrence of transient faults is extremely rare, we call this design criteria self-stabilization in the presence of seldom fairness.  ...  Acknowledgments: We thank Robert Gustafsson and Andreas Lindhé for useful discussions and for helping to improve the presentation significantly.  ... 
arXiv:1806.03498v1 fatcat:cdhkhj5fvjbuffzijizf6aextu

An Introduction to Population Protocols [chapter]

James Aspnes, Eric Ruppert
2009 Middleware for Network Eccentric and Mobile Applications  
Acknowledgments James Aspnes was supported in part by NSF grant CNS-0435201. Eric Ruppert was supported in part by the Natural Sciences and Engineering Research Council of Canada.  ...  A preliminary version of this survey appeared in [11] .  ...  The authors also describe a more robust version of the phase clock of [5] that, by incorporating elements of the three-state majority protocol, appears to self-stabilize in O(n log n) interactions once  ... 
doi:10.1007/978-3-540-89707-1_5 fatcat:vd5srezgxncgfl33k2n4y7zgzq

Self-stabilizing Uniform Reliable Broadcast [article]

Oskar Lundström and Michel Raynal and Elad M. Schiller
2020 arXiv   pre-print
Moreover, the communication costs of our algorithm are similar to the ones of the non-self-stabilizing state-of-the-art.  ...  In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according  ...  The need to have this new scheme shows that currently there no conclusive evidence for the existence of a meta-self-stabilizing scheme that can transfer any (or large family of) non-self-stabilizing algorithm  ... 
arXiv:2001.03244v1 fatcat:zafvw2usdrhyhg3nzemaojseyi

Declarative Framework for Specification, Simulation and Analysis of Distributed Applications

Jiefei Ma, Franck Le, Alessandra Russo, Jorge Lobo
2016 IEEE Transactions on Knowledge and Data Engineering  
In this paper we present a declarative framework for the specification, execution, simulation and analysis of distributed applications.  ...  To demonstrate the generality of our framework, we show how it can be used to analyse two classes of network routing protocols, a path vector and a Mobile Ad-Hoc Network (MANET) routing protocol, and execute  ...  In the absence of convergence, nodes may continuously change state impacting the stability of the overall routing system, and potentially affecting the delivery of traffic to the intended destinations.  ... 
doi:10.1109/tkde.2016.2515604 fatcat:ci6nugh64ncxdjsylzberel6bq

Consistency in Distributed Systems [chapter]

Sebastian Burckhardt
2015 Lecture Notes in Computer Science  
As more and more developers write programs that execute on a virtualized cloud infrastructure, they find themselves confronted with the subtleties that have long been the hallmark of distributed systems  ...  , including: -A beautiful, classic result: the impossibility of implementing consensus in the presence of silent crashes on an asynchronous system [8] (Section 2.5).  ...  The key requirement is that for every fair execution E of P we find a corresponding fair execution E of P .  ... 
doi:10.1007/978-3-319-28406-4_4 fatcat:6uux6ni4szbdlkmea5tgcbdukq

Terminating population protocols via some minimal global knowledge assumptions

Othon Michail, Paul G. Spirakis
2015 Journal of Parallel and Distributed Computing  
commutativity, where n is the number of nodes in the network.  ...  This represents a known upper bound on the cover time of a random walk.  ...  We would like to particularly thank James Aspnes for bringing to our attention the similarity of our model to the eventual leader detector Ω of [FJ06] .  ... 
doi:10.1016/j.jpdc.2015.02.005 fatcat:aiqc6rdeebdefebexmlt3bmsme

Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems [article]

Chryssis Georgiou, Oskar Lundström, Elad Michael Schiller
2020 arXiv   pre-print
We aim at the design of even more robust snapshot objects via the lenses of self-stabilization—a very strong notion of fault-tolerance. In addition to Delporte-Gallet et al.'  ...  s fault model, our self-stabilizing algorithm can recover after the occurrence of transient faults; these faults represent arbitrary violations of the assumptions according to which the system was designed  ...  In the context of self-stabilization, the literature includes a practically-self-stabilizing variation for the work of Attiya et al. [8] by Alon et al. [3] .  ... 
arXiv:1906.06420v2 fatcat:r4jihlmsf5bxjm4mtj3qo5eqgi

Asynchronous Consensus Without Rounds [article]

Robbert van Renesse
2019 arXiv   pre-print
In this paper, we derive a general specification of fault tolerant asynchronous consensus protocols and present a class of consensus protocols that refine this specification without using rounds.  ...  Fault tolerant consensus protocols usually involve ordered rounds of voting between a collection of processes.  ...  One approach is to associate a Vector Clock [23] with each vote. A vector clock is a vector with an integer entry for each process and is a compact representation of causal relationships.  ... 
arXiv:1908.10716v1 fatcat:mgq5mmmt7zc4raihazlfoa2heq

Clock Synchronization Algorithms over PTP-Unaware Networks: Reproducible Comparison Using an FPGA Testbed

Igor Freire, Camila Novaes, Igor Almeida, Eduardo Medeiros, Miguel Berg, Aldebaro Klautau
2021 IEEE Access  
The investigation provides insights regarding the synchronization performance under various scenarios of background traffic and oscillator stability.  ...  In this context, it is essential to process the noisy PTP measurements using algorithms and strategies that consider the underlying clock and packet delay models.  ...  The reason stems from the stability of the delays in this acquisition.  ... 
doi:10.1109/access.2021.3054164 fatcat:iwws7x6km5ambpsuq7vnjyyevu

Revisiting Liveness Properties in the Context of Secure Systems [chapter]

Felix C. Gärtner
2003 Lecture Notes in Computer Science  
We argue that in both cases the concept of a liveness property needs to be adapted.  ...  We study the adequacy of these abstractions, especially the liveness property abstraction, in the context of secure systems for two different scenarios: (1) Denial-of-service attacks and (2) brute-force  ...  Acknowledgments The author wishes to thank Klaus Kursawe for his insightful explanations on the motivations of his work.  ... 
doi:10.1007/978-3-540-40981-6_18 fatcat:56axxgphovcbhibqds6nky4rhy

Mechanical aspects of legged locomotion control

Daniel E. Koditschek, Robert J. Full, Martin Buehler
2004 Arthropod structure & development  
We review the mechanical components of an approach to motion science that enlists recent progress in neurophysiology, biomechanics, control systems engineering, and non-linear dynamical systems to explore  ...  We use rapid arthropod terrestrial locomotion as the model system because of the wealth of experimental data available.  ...  Likewise, we are indebted to Joel Weingarten for sharing with us his many insights into the details of how RHex clock parameters relate to the machine's general locomotion performance.  ... 
doi:10.1016/j.asd.2004.06.003 pmid:18089038 fatcat:h2ioe76y5rewpetsshhfoozrfi

The failure detector abstraction

Felix C. Freiling, Rachid Guerraoui, Petr Kuznetsov
2011 ACM Computing Surveys  
We also highlight some limitations of the failure detector abstraction along each of the dimensions.  ...  First we study failure detectors as building blocks to simplify the design of reliable distributed algorithms.  ...  Acknowledgments We wish to thank Martin Hutle for comments on a previous version of this paper and the anonymous reviewers for the constructive feedback.  ... 
doi:10.1145/1883612.1883616 fatcat:ltz65nnmrrhvfh7qnbkz4ylone

Partitionable group membership for Mobile Ad hoc Networks

L. Lim, D. Conan
2014 Journal of Parallel and Distributed Computing  
The specification of group membership in partitionable systems has not yet reached the same level of maturity as in primary partition systems.  ...  This results in the specification of an abortable consensus as the combination of two abstractions: An eventual α partition-participant detector and an eventual register per partition which guarantee liveness  ...  The local history of process p during an execution is a sequence of events or absences of events h p = (e 1 p e 2 p e 3 p . . . ), where an absence is denoted by ϵ and e i p corresponds to the ith event  ... 
doi:10.1016/j.jpdc.2014.03.003 fatcat:5w3pew5cdbbptedhb6aie3dkbu
« Previous Showing results 1 — 15 out of 2,377 results