{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T20:16:07Z","timestamp":1682453767699},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers and requires a majority of nonfaulty servers, while the other simulation tolerates Byzantine failures and assumes that two-thirds of the servers are nonfaulty. A construction of Afek et al. [3] is used to mask semi-Byzantine failures of clients that result in erroneous write operations. The simulations are used to derive Paxos algorithms that tolerate semi-Byzantine failures of clients as well as fail-stop or Byzantine failures of storage servers. <\/jats:p>","DOI":"10.1142\/s0129626406002745","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T11:24:00Z","timestamp":1166613840000},"page":"419-428","source":"Crossref","is-referenced-by-count":5,"title":["SHARING MEMORY WITH SEMI-BYZANTINE CLIENTS AND FAULTY STORAGE SERVERS"],"prefix":"10.1142","volume":"16","author":[{"given":"HAGIT","family":"ATTIYA","sequence":"first","affiliation":[{"name":"Department of Computer Science, The Technion, Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AMIR","family":"BAR-OR","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The Technion, Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0151-6"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227688"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0123-x"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0070-8"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786227"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0075-3"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1109\/2.928624"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626406002745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:29:08Z","timestamp":1565184548000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626406002745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":15,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129626406002745"],"URL":"https:\/\/doi.org\/10.1142\/s0129626406002745","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}