All File Systems are Not Created Equal: On the Complexity of Crafting Crash Consistent Applications

All File Systems are Not Created Equal: On the Complexity of Crafting Crash Consistent Applications - Pillai et al. 2014 Last week we looked at Reducing Crash Recoverability to Reachability for file system-based applications. Today's choice predates that work and investigates the semantics of real world file systems and how this affects applications that run … Continue reading All File Systems are Not Created Equal: On the Complexity of Crafting Crash Consistent Applications

The Heard-Of Model: Computing in Distributed Systems with Benign Failures

The Heard-Of Model: Computing in Distributed Systems with Benign Failures - Charron-Bost & Schiper2007 We briefly touched on the Heard-Of model last week when we looked at PSync. It's really very elegant, so today I thought it would be good to take a closer look. The traditional view of fault-tolerant distributed systems makes the following … Continue reading The Heard-Of Model: Computing in Distributed Systems with Benign Failures

Chapar: Certified Causally Consistent Distributed Key-Value Stores

Chapar: Certified Causally Consistent Distributed Key-Value Stores - Lesani et al. 2016 Another POPL '16 paper today. The Chapar framework provides for modular verification of causal consistency for both causally consistent key-value store implementations and for client programs written to use them. §1 also wins the prize for best use of emojis in a research … Continue reading Chapar: Certified Causally Consistent Distributed Key-Value Stores

Reducing Crash Recoverability to Reachability

Reducing Crash Recoverability to Reachability - Koskinen & Yang 2016. Techniques such as shadow paging and write-ahead logging can help with recovery from crashes, but even then it takes a lot of sophistication to get it right and deal with cases such as crashing during recovery itself. In today's paper Koskinen and Yang first provide … Continue reading Reducing Crash Recoverability to Reachability