4 citations · 7 across the 8 of their papers we have counts for
9 papers
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit
Hagit Attiya, Jennifer L. Welch
Algorithms to solve fault-tolerant consensus in asynchronous systems often rely on primitives such as crusader agreement, adopt-commit, and graded broadcast, which provide weaker a…
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
Hagit Attiya, Constantin Enea, Jennifer L. Welch
Atomic shared objects, whose operations take place instantaneously, are a powerful abstraction for designing complex concurrent programs. Since they are not always available, they…
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
Hagit Attiya, Constantin Enea, Jennifer Welch
A key way to construct complex distributed systems is through modular composition of linearizable concurrent objects. A prominent example is shared registers, which have crash-tole…
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
Hagit Attiya, Sweta Kumari, Archit Somani +1
We present an algorithm for implementing a store-collect object in an asynchronous crash-prone message-passing dynamic system, where nodes continually enter and leave. The algorith…
Byzantine-Tolerant Register in a System with Continuous Churn
Saptaparni Kumar, Jennifer L. Welch
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 faults i…
A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids
Reginald Frank, Jennifer L. Welch
Synchronizing clocks in a distributed system in which processes communicate through messages with uncertain delays is subject to inherent errors. Prior work has shown upper and low…