György E. Révész
Theoretical Computer Science
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.
György E. Révész
Theoretical Computer Science
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
Hendrik F. Hamann
InterPACK 2013
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering