The Impossibility of Fast Transactions

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 unveils an important, and so far unknown, limitation of fast transactions: they are impossible if we want to tolerate the failure of even one server.


Year:
Oct 14 2019
Keywords:
Laboratories:




 Record created 2019-10-14, last modified 2020-01-07

Fulltext:
technical report - Download fulltextPDF
new technical report - Download fulltextPDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)