Zohar Feldman, Avishai Mandelbaum
WSC 2010
Paper
Fork sequential consistency is blocking
Abstract
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency. © 2008 Elsevier B.V. All rights reserved.
Related
Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science