{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:26Z","timestamp":1758274046569,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T00:00:00Z","timestamp":1458691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2016,3,23]]},"abstract":"<jats:p>Sometimes all you need is the right language.<\/jats:p>","DOI":"10.1145\/2890782","type":"journal-article","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T15:04:15Z","timestamp":1458745455000},"page":"43-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Why logical clocks are easy"],"prefix":"10.1145","volume":"59","author":[{"given":"Carlos","family":"Baquero","sequence":"first","affiliation":[{"name":"Universidade do Minho and INESC Tec"}]},{"given":"Nuno","family":"Pregui\u00e7a","sequence":"additional","affiliation":[{"name":"Universidade NOVA de Lisboa"}]}],"member":"320","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2831090.2831103"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43352-2_6"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7478"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90055-M"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 11th Australian Computer Science Conference 10","author":"Fidge C.J.","year":"1988","unstructured":"Fidge , C.J. Timestamps in message-passing systems that preserve the partial ordering . Proceedings of the 11th Australian Computer Science Conference 10 , 1 ( 1988 ), 56--66. Fidge, C.J. Timestamps in message-passing systems that preserve the partial ordering. Proceedings of the 11th Australian Computer Science Conference 10, 1 (1988), 56--66."},{"key":"e_1_2_1_6_1","volume-title":"Why vector clocks are easy. Basho Blog","author":"Fink B.","year":"2010","unstructured":"Fink , B. Why vector clocks are easy. Basho Blog , 2010 ; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-easy\/. Fink, B. Why vector clocks are easy. Basho Blog, 2010; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-easy\/."},{"key":"e_1_2_1_7_1","volume-title":"How League of Legends scaled chat to 70 million players---it takes lots of minions. High Scalability","author":"Hoff T.","year":"2014","unstructured":"Hoff , T. How League of Legends scaled chat to 70 million players---it takes lots of minions. High Scalability ; http:\/\/highscalability.com\/blog\/ 2014 \/10\/13\/how-league-of-legends-scaled-chat-to-70-million-players-it-t.html. Hoff, T. How League of Legends scaled chat to 70 million players---it takes lots of minions. High Scalability; http:\/\/highscalability.com\/blog\/2014\/10\/13\/how-league-of-legends-scaled-chat-to-70-million-players-it-t.html."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043593"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the International Workshop on Parallel and Distributed Algorithms","author":"Mattern F.","year":"1988","unstructured":"Mattern , F. Virtual time and global states in distributed systems . In Proceedings of the International Workshop on Parallel and Distributed Algorithms ( Gers, France , 1988 ), 215-- 226. Mattern, F. Virtual time and global states in distributed systems. In Proceedings of the International Workshop on Parallel and Distributed Algorithms (Gers, France, 1988), 215-- 226."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2857274.2878574"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.236733"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332497"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02277859"},{"key":"e_1_2_1_15_1","volume-title":"Why vector clocks are hard. Basho Blog","author":"Sheehy J.","year":"2010","unstructured":"Sheehy , J. Why vector clocks are hard. Basho Blog , 2010 ; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-hard\/. Sheehy, J. Why vector clocks are hard. Basho Blog, 2010; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-hard\/."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742694.2745385"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890782","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2890782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:53:52Z","timestamp":1750222432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2890782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,23]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,3,23]]}},"alternative-id":["10.1145\/2890782"],"URL":"https:\/\/doi.org\/10.1145\/2890782","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2016,3,23]]},"assertion":[{"value":"2016-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}