2,634 Hits in 6.4 sec

Set Agreement and Renaming in the Presence of Contention-Related Crash Failures [chapter]

Anaïs Durand, Michel Raynal, Gadi Taubenfeld
2018 Lecture Notes in Computer Science  
It follows that the differentiation between λ-constrained crash failures and any time crash failures enlarges the space of executions in which the impossibility of k-set agreement and renaming in the presence  ...  The first algorithm solves k-set agreement, where k = m+f , in the presence of t = 2m + f − 1 crash failures, 2m of them being (n − k)-constrained failures, and (f − 1) being any time failures.  ...  -0023-03 DESCARTES (devoted to layered and modular structures in distributed computing).  ... 
doi:10.1007/978-3-030-03232-6_18 fatcat:jsbbamjvcbdzpjdtm5p436tbxm

Locks Considered Harmful: A Look at Non-traditional Synchronization [chapter]

Michel Raynal
2008 Lecture Notes in Computer Science  
This paper considers the implementation of concurrent objects in systems prone to asynchrony and process failures.  ...  The best that can be done in asynchronous systems prone to process crashes, and where the processes communicate only through read/write atomic registers, is a new naming space of size M = 2p − 1, where  ...  To cope with this problem, the wait-free approach has been presented and illustrated with a problem that is paradigm of synchronization in presence of failures and asynchrony, namely, the adaptive renaming  ... 
doi:10.1007/978-3-540-87785-1_33 fatcat:5334i7ywwbfxxafa3lzgi74she

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability

Eli GAFNI, Michel RAYNAL, Corentin TRAVERS
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
Considering an asynchonous system made up of n processes prone to crash, this paper addresses the power of such object types, namely, the k-test&set object type, the k-set agreement object type, and the  ...  adaptive M-renaming object type for M = 2p ; d p k e and M = min(2p ; 1 p + k ; 1), where p n is the number of processes that want to acquire a new name.  ...  Test&set, renaming and set agreement are among the basic problems that lie at the core of wait-free computability in asynchronous shared memory systems prone to process crashes.  ... 
doi:10.1109/srds.2007.8 dblp:conf/srds/GafniRT07 fatcat:brpkonmht5h6nl5wapliyll5ya

The notion of a timed register and its application to indulgent synchronization

Michel Raynal, Gadi Taubenfeld
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
Interestingly, timed registers are universal objects in systems with process crashes and transient timing failures (i.e., they allow building any concurrent object with a sequential specification).  ...  set, and consensus problems.  ...  Related work (2) : contention managers and wait-free algorithms.  ... 
doi:10.1145/1248377.1248413 dblp:conf/spaa/RaynalT07 fatcat:ulz3moilfzgxfdbdypdyimrdxy

Automatically Adjusting Concurrency to the Level of Synchrony [chapter]

Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy
2014 Lecture Notes in Computer Science  
In order to illustrate how the RC-simulation can be used, we describe a long-lived renaming implementation.  ...  Using RC-simulation, the quality of the service will adjust to the current level of asynchrony of the network -degrading when the system is very asynchronous, and improving when the system becomes more  ...  If the system is k-partially asynchronous, for 0 ≤ k < n, then the range of names provided by the renaming algorithm in [9] mediated by the RC-simulation is [1, n + k].  ... 
doi:10.1007/978-3-662-45174-8_1 fatcat:lomi3yewi5bszlvl2hlbljbn2e

The inherent cost of strong-partial view-synchronous communication [chapter]

Özalp Babaoğlu, Renzo Davoli, Luigi Giachini, Paolo Sabattini
1995 Lecture Notes in Computer Science  
We first derive necessary conditions on the partial order of installed views such that VSC is meaningful and solvable in the presence of partitions.  ...  As such, all know lower bound results for atomic commitment are also lower bounds for this problem, including the impossibility of nonblocking solutions in the presence of communication failures.  ...  This work has been supported in part by the Commission of European Communities under ESPRIT  ... 
doi:10.1007/bfb0022139 fatcat:wehrdvm47bhktaq3yinjel2t7u

Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation [chapter]

Damien Imbs, Michel Raynal
2009 Lecture Notes in Computer Science  
In its initial form, the BG simulation applies only to colorless decision tasks, i.e., tasks in which nothing prevents processes to decide the same value (e.g., consensus or k-set agreement tasks).  ...  The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up to t of them) a large number  ...  Acknowledgments The authors want to acknowledge E. Gafni, S. Rajsbaum, and C. Travers for interesting discussions on the BG-simulation.  ... 
doi:10.1007/978-3-642-05118-0_26 fatcat:q4vvl3o4dbc7tmbzwora64uuxu

From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach [article]

Damien Imbs, Michel Raynal, Julien Stainer
2016 arXiv   pre-print
the nature and understanding of crash and Byzantine failures in the context of asynchronous message-passing systems.  ...  In addition to extending the basic BG simulation to message-passing systems and failures more severe than process crashes, being modular and direct, this simulation provides us with a deeper insight in  ...  Acknowledgments This work has been partially supported by the Franco-German DFG-ANR Project 40300781. This project (named DISCMAT) is devoted to mathematical methods in distributed computing.  ... 
arXiv:1510.09119v2 fatcat:zjkt66ezcjbk7njnm3adl62fzi

Topological Methods in Distributed Computing (Dagstuhl Seminar 16282)

Dmitry Feichtner-Kozlov, Damien Imbs, Marc Herbstritt
2016 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Seminar 16282 "Topological Methods in Distributed Computing", which was attended by 22 international researchers, both junior and senior.  ...  This report gathers abstracts of the talks given by the participants and of the group research sessions that happened during the seminar.  ...  ) in the presence of even simple processor crash failures.  ... 
doi:10.4230/dagrep.6.7.31 dblp:journals/dagstuhl-reports/Feichtner-Kozlov16 fatcat:4ka6w55ee5geppiwvxtmy5jx5m

Tight Bounds for Asynchronous Renaming

Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Rachid Guerraoui
2014 Journal of the ACM  
This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers  ...  This gives a tight adaptive renaming algorithm with expected step complexity O(log k), where k is the contention in the current execution.  ...  presence of crash failures, communicating through operations on registers.  ... 
doi:10.1145/2597630 fatcat:gt7j4fblafgwlmghg7psymbhfi

Power and limits of distributed computing shared memory models

Maurice Herlihy, Sergio Rajsbaum, Michel Raynal
2013 Theoretical Computer Science  
Among them, the snapshot model and the iterated model are particularly investigated. The paper visits also several approaches that have been proposed to model crash failures.  ...  Among them, the wait-free case where any number of processes can crash is fundamental. The paper also considers models where up to t processes can crash, and where the crashes are not independent.  ...  ) shared memory model, in the presence of failures.  ... 
doi:10.1016/j.tcs.2013.03.002 fatcat:qtgkeyar5verrdnekteqc5rixu

t-Resilient Immediate Snapshot Is Impossible [chapter]

Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal
2016 Lecture Notes in Computer Science  
However, it has been shown in [28] that it is possible to capture the power of a failure detector (and other partially synchronous systems) in the IIS model by appropriately restricting its set of runs  ...  It allows each process to write a value and obtains a set of pairs (process id, value) such that, despite process crashes and asynchrony, the sets obtained by the processes satisfy noteworthy inclusion  ...  Acknowledgments This work has been partially supported by the French ANR project DISPLEXITY devoted to the study of Computability and Complexity in distributed computing, and the UNAM-PAPIIT project IN107714  ... 
doi:10.1007/978-3-319-48314-6_12 fatcat:7zpufphp2re7delj52kmn6uw7q

Notes on Theory of Distributed Systems [article]

James Aspnes
2021 arXiv   pre-print
Notes for the Yale course CPSC 465/565 Theory of Distributed Systems.  ...  closely-related problem of randomized test-and-set.  ...  With k − 1 crash failures, it's easy to build a k-set agreement algorithm: wait until you have seen n − k + 1 input values, then choose the smallest one you see.  ... 
arXiv:2001.04235v2 fatcat:viv5nl6qyvdnhjb73vm64gxj5u

Total order broadcast and multicast algorithms

Xavier Défago, André Schiper, Péter Urbán
2004 ACM Computing Surveys  
In short, the primitive ensures that messages sent to a set of processes are, in turn, delivered by all those processes in the same total order.  ...  The article discusses algorithms for both the synchronous and the asynchronous system models, and studies the respective properties and behavior of the different algorithms. X. Défago et al.  ...  Schlichting, Tatsuhiro Tsuchiya, and Matthias Wiesmann, as well as Fred B. Schneider, and the anonymous reviewers. We are also thankful to Judith Steeh for proofreading this text.  ... 
doi:10.1145/1041680.1041682 fatcat:hl2evvvb2zfrlhzzcrnyctdcfe

Higher SLA satisfaction in datacenters with continuous VM placement constraints

Huynh Tu Dang, Fabien Hermenier
2013 Proceedings of the 9th Workshop on Hot Topics in Dependable Systems - HotDep '13  
However, modern file systems vary widely in such behavior, reducing the correctness and performance of applications. In this paper, we study application-level crash consistency.  ...  In a virtualized datacenter, the Service Level Agreement for an application restricts the Virtual Machines (VMs) placement.  ...  We thank the developers and users of SQLite and LevelDB for helping us understand their software in detail.  ... 
doi:10.1145/2524224.2524226 dblp:conf/hotdep/DangH13 fatcat:xe5soaxhengtxcufr5oahrxyoq
« Previous Showing results 1 — 15 out of 2,634 results