Thomas R. Puzak, A. Hartstein, et al.
CF 2007
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
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev