A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

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

2003
*
Lecture Notes in Computer Science
*

This opens up the research question

doi:10.1007/978-3-540-39989-6_2
fatcat:wyx5buyu7bfpfjdskrcnvajfc4
*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*? ...##
###
A Characterization of t-Resilient Colorless Task Anonymous Solvability
[chapter]

2018
*
Lecture Notes in Computer Science
*

tasks that are

doi:10.1007/978-3-030-01325-7_18
fatcat:znjwyhboavb3rdgnp5o7xymppy
*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*. ...##
###
Set-Constrained Delivery Broadcast

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 . ...

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

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 . ...

##
###
A pleasant stroll through the land of infinitely many creatures

2004
*
ACM SIGACT News
*

Abstract Many distributed algorithms are designed for

doi:10.1145/992287.992298
fatcat:gnfkqw3nirfvbaulbtmlrg2ivy
*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? ...##
###
On Liveness of Dynamic Storage
[article]

2015
*
arXiv
*
pre-print

Intuitively, the impossibility relies on the fact that

arXiv:1507.07086v1
fatcat:2p7iavlhkrgtxdlxaauc4y5dri
*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. ...##
###
Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems
[article]

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. ...