Conference paper
Workshop on dependable middleware-based systems (WDMS 2002)
Dave Bakken, Roy Friedman, et al.
DSN 2002
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.
Dave Bakken, Roy Friedman, et al.
DSN 2002
Thomas Schmied, Diego Didona, et al.
EuroMLSys 2021
Oana Balmau, Florin Dinu, et al.
ACM TOCS
Joshua Auerbach, David F. Bacon, et al.
LCTES 2008