Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
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.
Michael D. Moffitt
ICCAD 2009
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Elliot Linzer, M. Vetterli
Computing
Leo Liberti, James Ostrowski
Journal of Global Optimization