Prasad Jayanti

According to our database, Prasad Jayanti authored at least 62 papers between 1990 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Δ-Snap: Snapshotting the Differential.

Prasad Jayanti, Siddhartha Jayanti

Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

A Shared Archive of Snapshots.

Prasad Jayanti, Siddhartha Visveswara Jayanti

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

MemSnap: Checkpointing Modern Shared-Memory (Abstract).

Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti

Proceedings of the 3rd Highlights of Parallel Computing Workshop, 2025

2024

A Universal, Sound, and Complete Forward Reasoning Technique for Machine-Verified Proofs of Linearizability.

Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez

Proc. ACM Program. Lang., January, 2024

MemSnap: A Fast Adaptive Snapshot Algorithm for RMWable Shared-Memory.

Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Meta-Configuration Tracking for Machine-Certified Correctness of Concurrent Data Structures (Abstract).

Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

Constant RMR Recoverable Mutex under System-wide Crashes.

Prasad Jayanti, Siddhartha Jayanti, Anup Joshi

CoRR, 2023

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms.

Prasad Jayanti, Siddhartha Jayanti, Ugur Y. Yavuz, Lizzie Hernandez

CoRR, 2023

Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining.

Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Constant RMR System-wide Failure Resilient Durable Locks with Dynamic Joining.

Prasad Jayanti, Siddhartha Jayanti, Anup Joshi

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Brief Announcement: Efficient Recoverable Writable-CAS.

Prasad Jayanti, Siddhartha Visveswara Jayanti, Sucharita Jayanti

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2021

Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM.

Prasad Jayanti, Siddhartha Jayanti

ACM Trans. Parallel Comput., 2021

2020

Towards an Ideal Queue Lock.

Prasad Jayanti, Siddhartha Jayanti, Sucharita Jayanti

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

2019

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines.

Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi

CoRR, 2019

2019 Principles of Distributed Computing Doctoral Dissertation Award.

Prasad Jayanti, Nancy A. Lynch, Boaz Patt-Shamir, Ulrich Schmid

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM.

Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Constant Amortized RMR Abortable Mutex for CC and DSM.

Prasad Jayanti, Siddhartha Jayanti

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Recoverable Mutual Exclusion with Abortability.

Prasad Jayanti, Anup Joshi

Proceedings of the Networked Systems - 7th International Conference, 2019

2018

Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models.

Prasad Jayanti, Siddhartha V. Jayanti

CoRR, 2018

Optimal Recoverable Mutual Exclusion Using only FASAS.

Prasad Jayanti, Siddhartha V. Jayanti, Anup Joshi

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Recoverable FCFS Mutual Exclusion with Wait-Free Recovery.

Prasad Jayanti, Anup Joshi

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Priority Mutual Exclusion: Specification and Algorithm.

Chien-Chung Huang, Prasad Jayanti

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

Enhancing Readers-Writers Exclusion with Upgrade/Downgrade Primitives.

Michael Diamond, Prasad Jayanti, Jake Leichtling

Proceedings of the Networked Systems - Third International Conference, 2015

2012

Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks.

Prasad Jayanti, Zhiyu Liu

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Tight time-space tradeoff for mutual exclusion.

Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Specification and Constant RMR Algorithm for Phase-Fair Reader-Writer Lock.

Vibhor Bhatt, Prasad Jayanti

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010

Constant RMR solutions to reader writer synchronization.

Vibhor Bhatt, Prasad Jayanti

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

On the Existence of Weakest Failure Detectors for Mutual Exclusion and <i>k</i>-Exclusion.

Vibhor Bhatt, Prasad Jayanti

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The 2009 Edsger W. Dijkstra Prize in Distributed Computing.

Lorenzo Alvisi, Rachid Guerraoui, Prasad Jayanti, Idit Keidar, Shay Kutten, Jennifer L. Welch

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Extracting quorum failure detectors.

Vibhor Bhatt, Nicholas Christman, Prasad Jayanti

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Every problem has a weakest failure detector.

Prasad Jayanti, Sam Toueg

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2005

An optimal multi-writer snapshot algorithm.

Prasad Jayanti

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion.

Prasad Jayanti, Srdjan Petrovic, Neha Narula

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Efficiently Implementing a Large Number of LL/SC Objects.

Prasad Jayanti, Srdjan Petrovic

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes.

Prasad Jayanti, Srdjan Petrovic

Proceedings of the Distributed Computing, 2005

Efficient Wait-Free Implementation of Multiword LL/SC Variables.

Prasad Jayanti, Srdjan Petrovic

Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks.

Prasad Jayanti, Srdjan Petrovic

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus.

Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg

SIAM J. Comput., 2004

2003

Fair group mutual exclusion.

Prasad Jayanti, Srdjan Petrovic, King Tan

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Efficient and practical constructions of LL/SC variables.

Prasad Jayanti, Srdjan Petrovic

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Adaptive and efficient abortable mutual exclusion.

Prasad Jayanti

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

<i>f</i>-arrays: implementation and applications.

Prasad Jayanti

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001

Bounding Lamport's Bakery Algorithm.

Prasad Jayanti, King Tan, Gregory Friedland, Amir Katz

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000

Time and Space Lower Bounds for Nonblocking Implementations.

Prasad Jayanti, King Tan, Sam Toueg

SIAM J. Comput., 2000

Almost Optimal Single Reader, Single Writer Atomic Register.

Prasad Jayanti, James E. Burns, Gary L. Peterson

J. Parallel Distributed Comput., 2000

1999

The Cost of Graceful Degradation for Omission Failures.

Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg

Inf. Process. Lett., 1999

1998

Solvability of Consensus: Composition Breaks Down for NonDeterministic Types.

Prasad Jayanti

SIAM J. Comput., 1998

A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa.

Prasad Jayanti

Proceedings of the Distributed Computing, 12th International Symposium, 1998

A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects.

Prasad Jayanti

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Lower Bound on the Local Time Complexity of Universal Constructions.

Prasad Jayanti

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

A Polylog Time Wait-Free Construction for Closed Objects.

Tushar Deepak Chandra, Prasad Jayanti, King Tan

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Robust wait-free hierarchies.

Prasad Jayanti

J. ACM, 1997

On the Power of Multi-objects.

Prasad Jayanti, Sanjay Khanna

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

1996

Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version).

Prasad Jayanti, King Tan, Sam Toueg

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Wait-free Computing.

Prasad Jayanti

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Fault-Tolerant Wait-Free Implementations and Robust Wait-Free Hierarchies.

Prasad Jayanti

PhD thesis, 1994

Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.

Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

On the Robustness of Herlihy's Hierarchy.

Prasad Jayanti

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Some Results on the Impossibility, Universality, and Decidability of Consensus.

Prasad Jayanti, Sam Toueg

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Fault-tolerant Wait-free Shared Objects

Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Minimal Shared Information for Concurrent Reading and Writing.

Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1990

Wakeup under Read/Write Atomicity.

Prasad Jayanti, Sam Toueg

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990