{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T15:30:38Z","timestamp":1675783838875},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:p> Recently, distributed shared memory systems have received much attention because such an abstraction simplifies programming. In this paper, we present a simple protocol which implements the linearizability consistency criterion in a distributed shared memory system. Unlike previously implemented protocols, our protocol is based on an optimistic approach. The protocol eliminates the necessity of potentially expensive synchronization among processors for each write operation, but may require processes to rollback. <\/jats:p>","DOI":"10.1142\/s0129626496000273","type":"journal-article","created":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T18:29:23Z","timestamp":1098988163000},"page":"265-278","source":"Crossref","is-referenced-by-count":4,"title":["AN OPTIMISTIC PROTOCOL FOR A LINEARIZABLE DISTRIBUTED SHARED MEMORY SYSTEM"],"prefix":"10.1142","volume":"06","author":[{"given":"MASAAKI","family":"MIZUNO","sequence":"first","affiliation":[{"name":"Department of Comp. and Info. Sciences, Kansas State University, Manhattan, KS 66506, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MITCHELL L.","family":"NEILSEN","sequence":"additional","affiliation":[{"name":"Computer Science Department, Oklahoma State University, Stillwater, OK 74078, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHEL","family":"RAYNAL","sequence":"additional","affiliation":[{"name":"IRISA, Campus de Beaulieu, 35042, Rennes-C\u00e9dex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626496000273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:45Z","timestamp":1565108325000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626496000273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1996,6]]}},"alternative-id":["10.1142\/S0129626496000273"],"URL":"https:\/\/doi.org\/10.1142\/s0129626496000273","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}