We consider distributed systems that work in dynamic asynchronous environments, such as
a shared storage system [8]. A configuration, is a set of active processors (servers or …

Dynamic distributed storage algorithms such as DynaStore, Reconfigurable Paxos, RAMBO,
and RDS, do not ensure liveness (wait-freedom) in asynchronous runs with infinitely many …

Providing clean and efficient foundations and tools for reconfiguration is a crucial enabler for
distributed system management today. This work takes a step towards developing such …

Emulating a shared register can mask the intricacies of designing algorithms for
asynchronous message-passing systems subject to crash failures, since it allows them to …

Erasure codes offer an efficient way to decrease storage and communication costs while
implementing atomic memory service in asynchronous distributed storage systems. In this …

This paper considers the problem of building fault-tolerant shared objects when processes
can crash and recover but lose their persistent state on recovery. This Diskless Crash …

This is a presentation of several approaches for employing shared memory abstraction in
distributed systems, a powerful tool for simplifying the design and implementation of …

A shared read/write register emulation provides the illusion of shared-memory on top of
message-passing models. The main hurdle with such emulations is dealing with server …

Snapshots are useful tools for monitoring big distributed and parallel systems. In this paper,
we adapt the well-known atomic snapshot abstraction to dynamic models with an …

The lattice agreement problem is an important decision problem in distributed systems. It
has applications in implementing atomic snapshot objects and building a special class of …