• Publications
  • Influence
Cure: Strong Semantics Meets High Availability and Low Latency
TLDR
This paper presents the protocols for highly available transactions, and an experimental evaluation showing that Cure is able to achieve scalability similar to NoSQL databases, while providing stronger guarantees. Expand
  • 88
  • 20
  • PDF
A Contention-Friendly Binary Search Tree
TLDR
We propose a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. Expand
  • 50
  • 12
  • PDF
(Leader/Randomization/Signature)-free Byzantine Consensus for Consortium Blockchains
TLDR
This paper presents a new Byzantine consensus algorithm targeting consortium blockchains. Expand
  • 39
  • 6
  • PDF
No Hot Spot Non-blocking Skip List
TLDR
This paper presents a non-blocking skip list algorithm that alleviates contention by localizing synchronization at the least contended part of the structure without altering consistency of the implemented abstraction. Expand
  • 39
  • 5
  • PDF
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains
TLDR
This paper introduces a new leaderless Byzantine consensus called the Democratic Byzantine Fault Tolerance (DBFT) for blockchains. Expand
  • 47
  • 3
  • PDF
A speculation-friendly binary search tree
TLDR
We introduce the first binary search tree algorithm designed for speculative executions. Expand
  • 64
  • 1
  • PDF
Evaluating the Red Belly Blockchain
TLDR
In this paper, we present a fast blockchain called the Red Belly Blockchain (RBBC)1 that is deterministic and does not assume synchrony. Expand
  • 21
  • 1
  • PDF
Towards a Universal Construction for Transaction-Based Multiprocess Programs
TLDR
The aim of a Software Transactional Memory (STM) system is to discharge the programmer from the explicit management of synchronization issues. Expand
  • 16
  • 1
A Fast Contention-Friendly Binary Search Tree
TLDR
This paper presents a fast concurrent binary search tree algorithm. Expand
  • 5
  • 1
  • PDF
STM Systems: Enforcing Strong Isolation between Transactions and Non-transactional Code
TLDR
This paper presents a TM algorithm that implements strong isolation with the following features: (a) concurrency control of non-transactional operations is not based on locks and is particularly efficient, and (b) any non- transactional read or write operation always terminates. Expand
  • 1
  • 1
  • PDF