{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:12:36Z","timestamp":1784211156907,"version":"3.55.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["2304758"],"award-info":[{"award-number":["2304758"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,1,8]]},"abstract":"<jats:p>\n                    Online services are commonly implemented with a scalable microservice architecture, where isomorphic workers process client requests, recording persistent state in a backend data store. To maintain service, modifications to service functionality must be made on the fly - i.e., as the service continues to process client requests - but doing so is challenging. The central difficulty is that of avoiding inconsistencies from\n                    <jats:italic toggle=\"yes\">mixed-mode<\/jats:italic>\n                    operation, caused by workers of current and new versions interacting via the data store. Some update methods avoid mixed-mode altogether, but only at the cost of substantial inefficiency - by doubling resources (memory and compute), or by halving throughput. The alternative is an uncontrolled \u201crolling\u201d update, which runs the risk of serious service failures arising from inconsistent mixed-mode behavior.\n                  <\/jats:p>\n                  <jats:p>Ideally, it should appear to every client that a service update takes effect atomically; this ensures that a client is not exposed to inconsistent mixed-mode behavior. In this paper, we introduce a framework that formalizes this intuition and develop foundational theory for reasoning about update consistency. We apply this theory to derive the first algorithms that guarantee consistency for mixed-mode updates. The algorithms rely on semantic properties of service actions, such as commutativity. We show that this is unavoidable, by proving that any semantically oblivious mixed-mode update method must allow inconsistencies.<\/jats:p>","DOI":"10.1145\/3776700","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:59:43Z","timestamp":1767898783000},"page":"1673-1701","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Consistent Updates for Scalable Microservices"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2905-075X","authenticated-orcid":false,"given":"Devora","family":"Chait-Roth","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6379-2442","authenticated-orcid":false,"given":"Kedar S.","family":"Namjoshi","sequence":"additional","affiliation":[{"name":"Nokia Bell Labs, Murray Hill, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4051-5968","authenticated-orcid":false,"given":"Thomas","family":"Wies","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/11785477_26"},{"key":"e_1_3_2_3_2","first-page":"55","volume-title":"fundamental concepts and mechanisms","author":"Babao\u011flu \u00d6zalp","year":"1993","unstructured":"\u00d6zalp Babao\u011flu and Keith Marzullo. 1993. Consistent global states of distributed systems: fundamental concepts and mechanisms. ACM Press\/Addison-Wesley Publishing Co., USA, 55-96."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89960-2_7"},{"key":"e_1_3_2_5_2","article-title":"Dynamic Module Replacement in a Distributed Programming System. Ph. D. Dissertation","author":"Bloom Toby","year":"1983","unstructured":"Toby Bloom. 1983. Dynamic Module Replacement in a Distributed Programming System. Ph. D. Dissertation. MIT, https:\/\/dspace.mit.edu\/handle\/1721.1\/15685","journal-title":"MIT"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1993.0014"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/4236.939450"},{"key":"e_1_3_2_8_2","article-title":"Consistent Updates for Scalable Microservices","author":"Chait-Roth Devora","year":"2025","unstructured":"Devora Chait-Roth, Kedar S. Namjoshi, and Thomas Wies. 2025. Consistent Updates for Scalable Microservices. arXiv:2508.04829 [cs.PL] https:\/\/arxiv.org\/abs\/2508.04829","journal-title":"arXiv:2508.04829 [cs.PL]"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3563349"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1006140.1006188"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10445-9_18"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2876749"},{"key":"e_1_3_2_14_2","unstructured":"Martin Fowler. 2010. Blue Green Deployment. https:\/\/martinfowler.com\/bliki\/BlueGreenDeployment.html. Accessed: 2025-09-15."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27705-4_22"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378798"},{"key":"e_1_3_2_17_2","unstructured":"Knight Capital 2013. Knight Capital LLC SEC Administrative Proceedings. https:\/\/www.sec.gov\/files\/litigation\/admin\/2013\/34-70694.pdf. Accessed: 2024-10-16."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.60317"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_20_2","first-page":"389","volume-title":"17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Li Ze","year":"2020","unstructured":"Ze Li, Qian Cheng, Ken Hsieh, Yingnong Dang, Peng Huang, Pankaj Singh, Xinsheng Yang, Qingwei Lin, Youjiang Wu, Sebastien Levy, and Murali Chintalapati. 2020. Gandalf: An Intelligent, End-To-End Analytics Service for Safe Deployment in Large-Scale Cloud Infrastructure. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20). USENIX Association, Santa Clara, CA, 389-402. https:\/\/www.usenix.org\/conference\/nsdi20\/presentation\/li"},{"key":"e_1_3_2_21_2","first-page":"215","volume-title":"Parallel and Distributed Algorithms","author":"Mattern Friedemann","year":"1989","unstructured":"Friedemann Mattern. 1989. Virtual Time and Global States of Distributed Systems. In Parallel and Distributed Algorithms. North-Holland, 215-226."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3651890.3672266"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1133255.1133991"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-82703-7_2"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1255450.1255455"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483577"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3776700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T13:45:03Z","timestamp":1784209503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3776700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":26,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2026,1,8]]}},"alternative-id":["10.1145\/3776700"],"URL":"https:\/\/doi.org\/10.1145\/3776700","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-07-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}