000083824 001__ 83824
000083824 005__ 20190812204925.0
000083824 02470 $$2ISI$$a000189491700043
000083824 037__ $$aCONF
000083824 245__ $$aRobust Emulations of Shared Memory in a Crash-Recovery Model
000083824 269__ $$a2004
000083824 260__ $$c2004
000083824 336__ $$aConference Papers
000083824 520__ $$aA shared memory abstraction can be robustly emulated over an asynchronous message passing system where any process can fail by crashing and possibly recover (crash-recovery model), by having (a) the processes exchange messages to synchronize their read and write operations and (b) log key information on their local stable storage. This paper extends the existing atomicity consistency criterion defined for multi-writer/multi-reader shared memory in a crash-stop model, by providing two new criteria for the crash-recovery model. We introduce lower bounds on the log-complexity for each of the two corresponding types of robust shared memory emulations. We demonstrate that our lower bounds are tight by providing algorithms that match them. Besides being optimal, these algorithms have the same message and time complexity as their most efficient counterpart we know of in the crash-stop model.
000083824 700__ $$0240335$$g105326$$aGuerraoui, Rachid
000083824 700__ $$aLevy, Ron R.
000083824 7112_ $$dMarch 23-26, 2004$$cTokyo, Japan$$a24th IEEE International Conference on Distributed Computing Systems (ICDCS'04)
000083824 773__ $$t24th IEEE International Conference on Distributed Computing Systems (ICDCS'04)$$q400-407
000083824 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/83824/files/paper.pdf$$s152085
000083824 909C0 $$xU10407$$pDCL$$0252114
000083824 909CO $$ooai:infoscience.tind.io:83824$$qGLOBAL_SET$$pconf$$pIC
000083824 937__ $$aLPD-CONF-2006-028
000083824 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000083824 980__ $$aCONF