4 citations · 8 across the 5 of their papers we have counts for
5 papers
Amortized Constant Round Atomic Snapshot in Message-Passing Systems
Vijay Garg, Saptaparni Kumar, Lewis Tseng +1
We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to nodes may crash. Our main result is a crash-tolerant atomic…
Reliable Broadcast in Practical Networks: Algorithm and Evaluation
Yingjian Wu, Haochen Pan, Saptaparni Kumar +1
Reliable broadcast is an important primitive to ensure that a source node can reliably disseminate a message to all the non-faulty nodes in an asynchronous and failure-prone networ…
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…
Simulating a Shared Register in a System that Never Stops Changing
Hagit Attiya, Hyun Chul Chung, Faith Ellen +2
Simulating a shared register can mask the intricacies of designing algorithms for asynchronous message-passing systems subject to crash failures, since it allows them to run algori…
Implementing with Bounded Messages on a Network of ADD Channels
Saptaparni Kumar, Jennifer Welch
We present an implementation of the eventually perfect failure detector () from the original hierarchy of the Chandra-Toueg oracles on an arbitrary partitionable networ…