Alejandro Z. Tomsic

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

We show that there is a three-way trade-off between read consistency, read delay (latency), and freshness, and that some desirable combinations are impossible. Expand

We introduce the Two-Windows Failure Detector (2W-FD), an algorithm able to react to sudden changes in network conditions, property that currently existing algorithms do not satisfy. Expand

A serverless event-stream processing service with pay-for-use and SLA’s must be scalable, highly available, and low cost. Expand

We identify that protocols that provide causal consistency share the well-known DUR (deferred update replication) algorithmic structure and observe that existing implementations of causal consistency fall into a sub-category of DUR that we name A-DUR. Expand

We present PhysiCS-NMSI, a transactional system ensuring NMSI over a partitioned data store. Expand

The protocols underlying large-scale geo-replicated storage systems implement a wide spectrum of transactional consistency criteria. Expand

The Mobile-Edge Computing standard promises co-locating edge servers with mobile phone base stations. Expand