Personne
Diego Didona
Cette personne n’est plus à l’EPFL
Publications associées (19)
PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the syn ...
IEEE COMPUTER SOC2019PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the ...
2019Distributed Transactional Systems Cannot Be Fast
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang, Panagiota Fatourou
We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...
2019The Impossibility of Fast Transactions
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Karolos Antoniadis
We prove that transactions cannot be fast in an asynchronous fault-tolerant system. Our result holds in any system where we require transactions to ensure monotonic writes, or any stronger consistency model, such as, causal consistency. Thus, our result un ...
2019Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores
Willy Zwaenepoel, Diego Didona
This paper introduces the concept of size-aware sharding to improve tail latencies for in-memory key-value stores, and describes its implementation in the Minos key-value store. Size-aware sharding distributes requests for keys to cores according to the si ...
USENIX ASSOC2019Kairos: Preemptive Data Center Scheduling Without Runtime Estimates
Willy Zwaenepoel, Pamela Isabel Delgado Borda, Diego Didona, Florin Dinu
The vast majority of data center schedulers use task runtime estimates to improve the quality of their scheduling decisions. Knowledge about runtimes allows the schedulers, among other things, to achieve better load balance and to avoid head-of-line blocki ...
2018Causal Consistency and Latency Optimality: Friend or Foe?
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang
Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...
ASSOC COMPUTING MACHINERY2018Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Transactional Causal Consistency (TCC) extends causal consistency, the strongest consistency model compatible with availability, with interactive read-write transactions, and is therefore particularly appealing for geo-replicated platforms. This paper pres ...
2018Distributed Transactions: Dissecting the Nightmare
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang
Many distributed storage systems are transactional and a lot of work has been devoted to optimizing their performance, especially the performance of read-only transactions that are considered the most frequent in practice. Yet, the results obtained so far ...
2018Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang
Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...
2018