{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:39:07Z","timestamp":1755999547069,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T00:00:00Z","timestamp":1586908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CNS-1714508"],"award-info":[{"award-number":["CNS-1714508"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,15]]},"DOI":"10.1145\/3342195.3387529","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T07:19:58Z","timestamp":1588576798000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Meerkat"],"prefix":"10.1145","author":[{"given":"Adriana","family":"Szekeres","sequence":"first","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Whittaker","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveen Kr.","family":"Sharma","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Krishnamurthy","sequence":"additional","affiliation":[{"name":"University of Washington"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan R. K.","family":"Ports","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223787"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584015"},{"key":"e_1_3_2_1_3_1","volume-title":"Highly Available Storage for Interactive Services. In Proc. of CIDR","author":"Baker J.","year":"2011","unstructured":"J. Baker , C. Bond , J. C. Corbett , J. Furman , A. Khorlin , J. Larson , J.-M. Leon , Y. Li , A. Lloyd , and V. Yushprakh . Megastore: Providing Scalable , Highly Available Storage for Interactive Services. In Proc. of CIDR , 2011 . J. Baker, C. Bond, J. C. Corbett, J. Furman, A. Khorlin, J. Larson, J.-M. Leon, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing Scalable, Highly Available Storage for Interactive Services. In Proc. of CIDR, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/12518"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of NSDI","author":"Bolosky W. J.","year":"2011","unstructured":"W. J. Bolosky , D. Bradshaw , R. B. Haagens , N. P. Kusters , and P. Li . Paxos Replicated State Machines as the Basis of a High-Performance Data Store . In Proc. of NSDI , 2011 . W. J. Bolosky, D. Bradshaw, R. B. Haagens, N. P. Kusters, and P. Li. Paxos Replicated State Machines as the Basis of a High-Performance Data Store. In Proc. of NSDI, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522712"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of OSDI","author":"Corbett J. C.","year":"2012","unstructured":"J. C. Corbett , J. Dean , M. Epstein , A. Fikes , C. Frost , J. Furman , S. Ghemawat , A. Gubarev , C. Heiser , P. Hochschild , W. Hsieh , S. Kanthak , E. Kogan , H. Li , A. Lloyd , S. Melnik , D. Mwaura , D. Nagle , S. Quinlan , R. Rao , L. Rolig , Y. Saito , M. Szymaniak , C. Taylor , R. Wang , and D. Woodford . Spanner: Google's Globally-Distributed Database . In Proc. of OSDI , 2012 . J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, W. Hsieh, S. Kanthak, E. Kogan, H. Li, A. Lloyd, S. Melnik, D. Mwaura, D. Nagle, S. Quinlan, R. Rao, L. Rolig, Y. Saito, M. Szymaniak, C. Taylor, R. Wang, and D. Woodford. Spanner: Google's Globally-Distributed Database. In Proc. of OSDI, 2012."},{"key":"e_1_3_2_1_9_1","article-title":"Granola","author":"Cowling J.","year":"2012","unstructured":"J. Cowling and B. Liskov . Granola : Low-Overhead Distributed Transaction Coordination. In Proc. of USENIX ATC , 2012 . J. Cowling and B. Liskov. Granola: Low-Overhead Distributed Transaction Coordination. In Proc. of USENIX ATC, 2012.","journal-title":"Low-Overhead Distributed Transaction Coordination. In Proc. of USENIX ATC"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815427"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2014.6818330"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592800"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of ICDE","author":"Hong C.","year":"2013","unstructured":"C. Hong , D. Zhou , M. Yang , C. Kuo , L. Zhang , and L. Zhou . KuaFu: Closing the Parallelism Gap in Database Replication . In Proc. of ICDE , 2013 . C. Hong, D. Zhou, M. Yang, C. Kuo, L. Zhang, and L. Zhou. KuaFu: Closing the Parallelism Gap in Database Replication. In Proc. of ICDE, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198079"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of NSDI","author":"Kalia A.","year":"2019","unstructured":"A. Kalia , M. Kaminsky , and D. Andersen . Datacenter RPCs can be General and Fast . In Proc. of NSDI , 2019 . A. Kalia, M. Kaminsky, and D. Andersen. Datacenter RPCs can be General and Fast. In Proc. of NSDI, 2019."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of OSDI","author":"Kapritsos M.","year":"2012","unstructured":"M. Kapritsos , Y. Wang , V. Quema , A. Clement , L. Alvisi , and M. Dahlin . All About Eve: Execute-verify Replication for Multi-core Servers . In Proc. of OSDI , 2012 . M. Kapritsos, Y. Wang, V. Quema, A. Clement, L. Alvisi, and M. Dahlin. All About Eve: Execute-verify Replication for Multi-core Servers. In Proc. of OSDI, 2012."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of SIGMOD","author":"Kimura H.","year":"2015","unstructured":"H. Kimura . FOEDUS : OLTP Engine for a Thousand Cores and NVRAM . In Proc. of SIGMOD , 2015 . H. Kimura. FOEDUS: OLTP Engine for a Thousand Cores and NVRAM. In Proc. of SIGMOD, 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_3_2_1_20_1","volume-title":"ACM SIGACT News","author":"Lamport L.","year":"2001","unstructured":"L. Lamport . Paxos made simple . ACM SIGACT News , 2001 . L. Lamport. Paxos made simple. ACM SIGACT News, 2001."},{"key":"e_1_3_2_1_22_1","unstructured":"C. Leau. Spring Data Redis - Retwis-J 2013. http:\/\/docs.spring.io\/spring-data\/data-keyvalue\/examples\/retwisj\/current\/.  C. Leau. Spring Data Redis - Retwis-J 2013. http:\/\/docs.spring.io\/spring-data\/data-keyvalue\/examples\/retwisj\/current\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352141"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of SOSP","author":"Li J.","year":"2017","unstructured":"J. Li , E. Michael , and D. R. K. Ports . Eris : Coordination-free consistent transactions using in-network concurrency control . In Proc. of SOSP , 2017 . J. Li, E. Michael, and D. R. K. Ports. Eris: Coordination-free consistent transactions using in-network concurrency control. In Proc. of SOSP, 2017."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of OSDI","author":"Li J.","year":"2016","unstructured":"J. Li , E. Michael , A. Szekeres , N. K. Sharma , and D. R. K. Ports . Just say NO to Paxos overhead: Replacing consensus with network ordering . In Proc. of OSDI , 2016 . J. Li, E. Michael, A. Szekeres, N. K. Sharma, and D. R. K. Ports. Just say NO to Paxos overhead: Replacing consensus with network ordering. In Proc. of OSDI, 2016."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_3_2_1_27_1","volume-title":"Viewstamped replication revisited","author":"Liskov B.","year":"2012","unstructured":"B. Liskov and J. Cowling . Viewstamped replication revisited , 2012 . B. Liskov and J. Cowling. Viewstamped replication revisited, 2012."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of DISC","author":"Michael E.","year":"2017","unstructured":"E. Michael , D. R. K. Ports , N. K. Sharma , and A. Szekeres . Recovering Shared Objects Without Stable Storage . In Proc. of DISC , 2017 . E. Michael, D. R. K. Ports, N. K. Sharma, and A. Szekeres. Recovering Shared Objects Without Stable Storage. In Proc. of DISC, 2017."},{"key":"e_1_3_2_1_30_1","unstructured":"Microsoft SQLServer. https:\/\/www.microsoft.com\/en-us\/sql-server\/default.aspx.  Microsoft SQLServer. https:\/\/www.microsoft.com\/en-us\/sql-server\/default.aspx."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. of OSDI","author":"Mu S.","year":"2016","unstructured":"S. Mu , L. Nelson , W. Lloyd , and J. Li . Consolidating Concurrency Control and Consensus for Commits under Conflicts . In Proc. of OSDI , 2016 . S. Mu, L. Nelson, W. Lloyd, and J. Li. Consolidating Concurrency Control and Consensus for Commits under Conflicts. In Proc. of OSDI, 2016."},{"key":"e_1_3_2_1_33_1","unstructured":"MySQL. https:\/\/www.mysql.com\/.  MySQL. https:\/\/www.mysql.com\/."},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. of PODC","author":"Oki B. M.","year":"1988","unstructured":"B. M. Oki and B. H. Liskov . Viewstamped replication: A new primary copy method to support highly-available distributed systems . In Proc. of PODC , 1988 . B. M. Oki and B. H. Liskov. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proc. of PODC, 1988."},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. of USENIX ATC","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. Ousterhout . In search of an understandable consensus algorithm . In Proc. of USENIX ATC , 2014 . D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm. In Proc. of USENIX ATC, 2014."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767438"},{"key":"e_1_3_2_1_37_1","unstructured":"PostgreSQL. http:\/\/www.postgresql.org\/.  PostgreSQL. http:\/\/www.postgresql.org\/."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151107"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938549"},{"key":"e_1_3_2_1_40_1","volume-title":"ACM Comput. Surv.","author":"Schneider F. B.","year":"1990","unstructured":"F. B. Schneider . Implementing Fault-tolerant Services Using the State Machine Approach : A Tutorial . ACM Comput. Surv. , 1990 . F. B. Schneider. Implementing Fault-tolerant Services Using the State Machine Approach: A Tutorial. ACM Comput. Surv., 1990."},{"key":"e_1_3_2_1_41_1","volume-title":"Proc. of VLDB","author":"Stonebraker M.","year":"2007","unstructured":"M. Stonebraker , S. Madden , D. J. Abadi , S. Harizopoulos , N. Hachem , and P. Helland . The end of an Architectural Era: (It's Time for a Complete Rewrite) . In Proc. of VLDB , 2007 . M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an Architectural Era: (It's Time for a Complete Rewrite). In Proc. of VLDB, 2007."},{"key":"e_1_3_2_1_43_1","volume-title":"Nov.","author":"Tahara D.","year":"2018","unstructured":"D. Tahara . Cross shard transactions at 10 million requests per second. https:\/\/blogs.dropbox.com\/tech\/2018\/11\/cross-shard-transactions-at-10-million-requests-per-second\/ , Nov. 2018 . D. Tahara. Cross shard transactions at 10 million requests per second. https:\/\/blogs.dropbox.com\/tech\/2018\/11\/cross-shard-transactions-at-10-million-requests-per-second\/, Nov. 2018."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/320071.320076"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_3_2_1_47_1","volume-title":"Proc. of OSDI","author":"van Renesse R.","year":"2004","unstructured":"R. van Renesse and F. B. Schneider . Chain replication for supporting high throughput and availability . In Proc. of OSDI , 2004 . R. van Renesse and F. B. Schneider. Chain replication for supporting high throughput and availability. In Proc. of OSDI, 2004."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015276"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055335"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815404"}],"event":{"name":"EuroSys '20: Fifteenth EuroSys Conference 2020","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Heraklion Greece","acronym":"EuroSys '20"},"container-title":["Proceedings of the Fifteenth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3342195.3387529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3342195.3387529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:26Z","timestamp":1750207406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3342195.3387529"}},"subtitle":["multicore-scalable replicated transactions following the zero-coordination principle"],"short-title":[],"issued":{"date-parts":[[2020,4,15]]},"references-count":50,"alternative-id":["10.1145\/3342195.3387529","10.1145\/3342195"],"URL":"https:\/\/doi.org\/10.1145\/3342195.3387529","relation":{},"subject":[],"published":{"date-parts":[[2020,4,15]]},"assertion":[{"value":"2020-04-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}