Bowen Zhou, Bing Xiang, et al.
SSST 2008
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
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990