5 citations · 6 across the 6 of their papers we have counts for
7 papers · 1 filter
Asynchronous Quantum Distributed Computing: Causality, Snapshots, and Global Operations
Siddhartha Visveswara Jayanti, Anand Natarajan
We initiate the study of asynchronous quantum distributed systems, focusing on the case of implementing atomic quantum global operations that can be decomposed into a collection of…
A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms
Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz +1
Linearizability has been the long standing gold standard for consistency in concurrent data structures. However, proofs of linearizability can be long and intricate, hard to produc…
Constant RMR Recoverable Mutex under System-wide Crashes
Prasad Jayanti, Siddhartha Jayanti, Anup Joshi
We design two Recoverable Mutual Exclusion (RME) locks for the system-wide crash model. Our first algorithm requires only space per process, and achieves worst-case R…
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining
Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti
We present durable implementations for two well known universal primitives -- CAS (compare-and-swap), and its ABA-free counter-part LLSC (load-linked, store-conditional). All our i…
Concurrent Disjoint Set Union
Siddhartha V. Jayanti, Robert E. Tarjan
We develop and analyze concurrent algorithms for the disjoint set union (union-find) problem in the shared memory, asynchronous multiprocessor model of computation, with CAS (compa…
A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
Prasad Jayanti, Siddhartha Jayanti, Anup Joshi
In light of recent advances in non-volatile main memory technology, Golab and Ramaraju reformulated the traditional mutex problem into the novel {\em Recoverable Mutual Exclusion}…