Filters








7 Hits in 2.0 sec

Uniform Solvability with a Finite Number of MWMR Registers [chapter]

Marcos K. Aguilera, Burkhard Englert, Eli Gafni
2003 Lecture Notes in Computer Science  
This opens up the research question of when a task is uniformly solvable using only finitely many MWMR registers.  ...  Here we show that there are simple tasks which provably cannot be solved uniformly with finitely many MWMR registers.  ...  Can one-shot collect be accomplished with a finite number of MWMR registers?  ... 
doi:10.1007/978-3-540-39989-6_2 fatcat:wyx5buyu7bfpfjdskrcnvajfc4

A Characterization of t-Resilient Colorless Task Anonymous Solvability [chapter]

Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa
2018 Lecture Notes in Computer Science  
tasks that are solvable when any number of asynchronous processes may crash.  ...  One of the central questions in distributed computability is characterizing the tasks that are solvable in a given system model.  ...  However, they allow the use of SWMR registers while we assume a fully anonymous model with only MWMR registers.  ... 
doi:10.1007/978-3-030-01325-7_18 fatcat:znjwyhboavb3rdgnp5o7xymppy

Set-Constrained Delivery Broadcast

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
2018 Proceedings of the 19th International Conference on Distributed Computing and Networking - ICDCN '18  
a set of messages including a message m ′ , no process delivers first a set of messages including m ′ and later a set of message including m.  ...  This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers  ...  It inserted a quadruplet qdplt with timestamp sd, sn sd on line 9 and by what precedes, sd, sn sd has a finite number of predecessors sd 1 , sn 1 , . . . , sd l , sn l according to → ⋆ i .  ... 
doi:10.1145/3154273.3154296 dblp:conf/icdcn/ImbsMPR18 fatcat:6z3pafgne5hr3m6pabdi4qehsm

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits [article]

Damien Imbs, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
a set of messages including a message m ' , no process delivers first a set of messages including m ' and later a set of message including m.  ...  This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers  ...  It inserted a quadruplet qdplt with timestamp sd, sn sd on line 9 and by what precedes, sd, sn sd has a finite number of predecessors sd 1 , sn 1 , . . . , sd l , sn l according to → ⋆ i .  ... 
arXiv:1706.05267v1 fatcat:h2fexyzcenbb7ovtlvun77adv4

A pleasant stroll through the land of infinitely many creatures

Marcos K. Aguilera
2004 ACM SIGACT News  
Abstract Many distributed algorithms are designed for a system with a fixed set of n processes.  ...  The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements.  ...  But the general characterization of solvable tasks with finitely many registers in M 2 is an open problem. Can consensus be solved in a system with infinitely many processes?  ... 
doi:10.1145/992287.992298 fatcat:gnfkqw3nirfvbaulbtmlrg2ivy

On Liveness of Dynamic Storage [article]

Alexander Spiegelman, Idit Keidar
2015 arXiv   pre-print
Intuitively, the impossibility relies on the fact that a correct process can be suspected to have failed at any time, i.e., its failure is indistinguishable to other processes from slow delivery of its  ...  To circumvent this result, we define a dynamic eventually perfect failure detector, and present an algorithm that uses it to emulate wait-free dynamic atomic storage (with no restrictions on reconfiguration  ...  Hence, a finite number of operations are invoked by processes with sm.ts ≤ T S at the time of the invocation.  ... 
arXiv:1507.07086v1 fatcat:2p7iavlhkrgtxdlxaauc4y5dri

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

Chryssis Georgiou, Oskar Lundström, Elad Michael Schiller
2020 arXiv   pre-print
A snapshot object simulates the behavior of an array of single-writer/multi-reader shared registers that can be read atomically.  ...  It uses O(n) messages of O(n ν) bits, where n is the number of nodes and ν is the number of bits it takes to represent the object.  ...  The value of x is actually finite and x ≤ δ. Proof of claim. Arguments (1) to (3) show that x ≤ δ. Moreover, between c and c there are a finite number of steps.  ... 
arXiv:1906.06420v2 fatcat:r4jihlmsf5bxjm4mtj3qo5eqgi