3 citations · 4 across the 4 of their papers we have counts for
6 papers
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…
Recoverable Mutual Exclusion with Abortability
Prasad Jayanti, Anup Joshi
Recent advances in non-volatile main memory (NVRAM) technology have spurred research on designing algorithms that are resilient to process crashes. This paper is a fuller version o…
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}…
Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models
Prasad Jayanti, Siddhartha Jayanti
The abortable mutual exclusion problem was introduced by Scott and Scherer to meet a need that arises in database and real time systems, where processes sometimes have to abandon t…