Share This Author
Concurrency and Privacy with Payment-Channel Networks
- Giulio Malavolta, Pedro A. Moreno-Sanchez, Aniket Kate, Matteo Maffei, Srivatsan Ravi
- Computer ScienceIACR Cryptol. ePrint Arch.
- 30 October 2017
This work lays the foundations for privacy and concurrency in PCNs, presenting a formal definition in the Universal Composability framework as well as practical and provably secure solutions.
Safety of Deferred Update in Transactional Memory
- H. Attiya, Sandeep Hans, P. Kuznetsov, Srivatsan Ravi
- Computer ScienceIEEE 33rd International Conference on Distributed…
- 26 January 2013
A variant of opacity that explicitly requires the sequential order to respect the deferred-update semantics is proposed, and it is shown that the property is equivalent to opacity if no two transactions commit identical values on the same variable, and present a counter-example for scenarios when the “unique-write” assumption does not hold.
Generalized Paxos Made Byzantine (and Less Complex)
This paper attempts to provide a simpler description of Generalized Paxos, based on a simpler specification and the pseudocode for a solution that can be readily implemented, and extends the protocol to the Byzantine fault model, and provides the respective correctness proof.
On the Cost of Concurrency in Transactional Memory
The Transactional Memory abstraction is proposed as a synchronization mechanism that relieves the programmer of the overhead of reasoning about data conflicts that may arise from concurrent operations without severely limiting the program's performance.
On Partial Wait-Freedom in Transactional Memory
The costs of providing wait-freedom to only a subset of transactions, which requires that read-only transactions commit in the wait-free manner, while updating transactions are guaranteed to commit only if they run in the absence of concurrency are explored.
PLASMA: programmable elasticity for stateful cloud computing applications
- Bo Sang, Pierre-Louis Roman, P. Eugster, Hui Lu, Srivatsan Ravi, G. Petri
- Computer ScienceEuroSys
- 15 April 2020
PLASMA (Programmable Elasticity for Stateful Cloud Computing Applications) is a programming framework for elastic stateful cloud applications that includes an elasticity programming language as a second "level" of programming (complementing the main application programming language) for describing elasticity behavior.
Revisiting Nakamoto Consensus in Asynchronous Networks: A Comprehensive Analysis of Bitcoin Safety and ChainQuality
- Muhammad Saad, Afsah Anwar, Srivatsan Ravi, David A. Mohaisen
- Computer Science, MathematicsCCS
- 12 November 2021
This paper shows that the network synchrony does not hold in the real world Bitcoin network, and presents the HashSplit attack that allows an adversary to orchestrate concurrent mining on multiple branches of the blockchain to violate common prefix and chain quality properties.
Progressive Transactional Memory in Time and Space
It is shown that the total number of remote memory references RMRs that take place in an execution of a progressive TM in which n concurrent processes perform transactions on a single data item might reach $$\varOmega n \log n$$, which appears to be the first RMR complexity lower bound for transactional memory.
Programming Scalable Cloud Services with AEON
- Bo Sang, G. Petri, Masoud Saeida Ardekani, Srivatsan Ravi, P. Eugster
- Computer ScienceMiddleware
- 28 November 2016
AEON is introduced: a framework that provides the following properties: Programmability: programmers only need to reason about sequential semantics when reasoning about concurrency resulting from multi-actor events; Scalability: AEON runtime protocol guarantees serializable and starvation-free execution of multi- actor events, while maximizing parallel execution; Elasticity: AEONS supports fine-grained elasticity enabling the programmer to transparently migrate individual actors without violating the consistency or entailing significant performance overheads.
Why Transactional Memory Should Not Be Obstruction-Free
This paper explains the shift in the TM practice theoretically, via complexity bounds, and proves a few important lower bounds on obstruction-free TMs, and presents a lock-based TM implementation that beats all of these lower bounds.