Loading...
report
The Impossibility of Fast Transactions
October 14, 2019
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.
Loading...
Name
IPDPS_paper.pdf
Access type
openaccess
Size
646.54 KB
Format
Adobe PDF
Checksum (MD5)
a600939bd7a97a84b780904cb4cc5f38
Loading...
Name
new technical report.pdf
Access type
openaccess
Size
360.23 KB
Format
Adobe PDF
Checksum (MD5)
e42189d9b7af7a03c8f6d37544246b43