• Publications
  • Influence
Cure: Strong Semantics Meets High Availability and Low Latency
The protocols for highly available transactions, and an experimental evaluation showing that Cure is able to achieve scalability similar to eventually-consistent NoSQL databases, while providing stronger guarantees. Expand
Antidote: the highly-available geo-replicated database with strongest guarantees
Cloud-scale applications need highly available, low latency responses to serve millions of users around the world. To meet this need, applications have to carefully choose a high performanceExpand
FMKe: a Real-World Benchmark for Key-Value Data Stores
This paper proposes the first standardized benchmark specially tailored for weakly consistent key-value stores, named FMKe, which is modeled after a real application: the Danish National Joint Medicine Card. Expand
Global-Local View: Scalable Consistency for Concurrent Data Types
A new model which leverages ad-hoc techniques to eliminate the need for synchronous atomic updates for concurrent access to objects in a shared memory system is proposed and the design of several datatypes are discussed and their performance and scalability are evaluated. Expand
Transactions on Mergeable Objects
Paradigms such as Transactional Memory support the programmer in correctly synchronizing access to mutable shared data by serializing the transactional reads and writes, but under high contention, serializable transactions incur frequent aborts and limit parallelism. Expand
Observing the consistency of distributed systems
The initial work on divergence metrics is presented and a preliminary evaluation on exposing divergence to the system operator is given. Expand
Highly-scalable concurrent objects
This paper presents Mergeable Data Types (MDTs) for relaxing synchronisation in shared memory system analogously to CRDTs in replicated systems and presents the key properties of MDTs and discusses the design of several MDTs. Expand
Scalable Consistency in the Multi-core Era
The Global-Local View Model is proposed, a programming model that exploits the heterogeneous access latencies in many-core systems and provides a consistency semantics that allows for more scalability even under contention. Expand
Performance simulation of buffer bloat in routers
Due to the dramatic price drop of memory network devices are configured with much larger buffer sizes than before in order to prevent packet drop. This undermines the assumptions of the TCPExpand
Multi-view data types for scalable concurrency in the multi-core era
By executing operations on the local state without synchronization, while only synchronizing with the shared state when needed, applications can achieve better scalability at the expense of linearizability - the default correctness criteria for concurrent objects. Expand