{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:13:32Z","timestamp":1766441612747,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC","award":["RGPIN-2014-05296","903-2011-RGPIN"],"award-info":[{"award-number":["RGPIN-2014-05296","903-2011-RGPIN"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933111","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"325-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["An Algorithm for Replicated Objects with Efficient Reads"],"prefix":"10.1145","author":[{"given":"Tushar D.","family":"Chandra","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Vassos","family":"Hadzilacos","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0068-y"},{"key":"e_1_3_2_1_2_1","first-page":"335","volume-title":"OSDI '06","author":"Burrows Mike","year":"2006","unstructured":"Mike Burrows . The Chubby lock service for loosely-coupled distributed systems . In OSDI '06 , pages 335 -- 350 , 2006 . Mike Burrows. The Chubby lock service for loosely-coupled distributed systems. In OSDI '06, pages 335--350, 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_7_1","first-page":"261","volume-title":"OSDI '12","author":"James","year":"2012","unstructured":"James Corbett et al. Spanner: Google's globally-distributed database . In OSDI '12 , pages 261 -- 264 , 2012 . James Corbett et al. Spanner: Google's globally-distributed database. In OSDI '12, pages 261--264, 2012."},{"key":"e_1_3_2_1_8_1","first-page":"223","volume-title":"CIDR '11","author":"Jason","year":"2011","unstructured":"Jason Baker et al. Megastore: Providing scalable, highly available storage for interactive services . In CIDR '11 , pages 223 -- 234 , 2011 . Jason Baker et al. Megastore: Providing scalable, highly available storage for interactive services. In CIDR '11, pages 223--234, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2671001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62549"},{"key":"e_1_3_2_1_14_1","first-page":"305","volume-title":"USENIX ATC'14","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout . In search of an understandable consensus algorithm . In USENIX ATC'14 , pages 305 -- 320 , 2014 . An extended version of this paper is in phhttp:\/\/ramcloud.stanford.edu\/raft.pdf. Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In USENIX ATC'14, pages 305--320, 2014. An extended version of this paper is in phhttp:\/\/ramcloud.stanford.edu\/raft.pdf."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2008.4630089"}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago Illinois USA","acronym":"PODC '16"},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":14,"alternative-id":["10.1145\/2933057.2933111","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933111","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}