{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:51Z","timestamp":1750306371101,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":["Queue"],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>Any computing system can be described as executing sequences of actions, with an action being any relevant change in the state of the system. For example, reading a file to memory, modifying the contents of the file in memory, or writing the new contents to the file are relevant actions for a text editor. In a distributed system, actions execute in multiple locations; in this context, actions are often called events. Examples of events in distributed systems include sending or receiving messages, or changing some state in a node. Not all events are related, but some events can cause and influence how other, later events occur. For example, a reply to a received mail message is influenced by that message, and maybe by prior messages received.<\/jats:p>","DOI":"10.1145\/2898442.2917756","type":"journal-article","created":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T04:11:45Z","timestamp":1599106305000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Why Logical Clocks are Easy"],"prefix":"10.1145","volume":"14","author":[{"given":"Carlos","family":"Baquero","sequence":"first","affiliation":[]},{"given":"Nuno","family":"Pregui\u00e7a","sequence":"additional","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2016,2]]},"reference":[{"volume-title":"Proceedings of the 15th Workshop on Hot Topics in Operating Systems","year":"2015","author":"Ajoux P.","key":"e_1_2_1_1_1"},{"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"},{"volume-title":"Proceedings of the 11th Australian Computer Science Conference 10(1): 56-66","year":"1988","author":"Fidge C. J.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","unstructured":"Fink B. 2010. Why vector clocks are easy. Basho Blog; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-easy\/.  Fink B. 2010. Why vector clocks are easy. Basho Blog; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-easy\/."},{"key":"e_1_2_1_7_1","unstructured":"Hoff T. 2014. 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. 2014. 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"},{"volume-title":"Proceedings of the International Workshop on Parallel and Distributed Algorithms, Gers, France: 215- 226","year":"1988","author":"Mattern F.","key":"e_1_2_1_10_1"},{"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","unstructured":"Sheehy J. 2010. Why vector clocks are hard. Basho Blog; http:\/\/basho.com\/posts\/technical\/why-vector-clocks-are-hard\/.  Sheehy J. 2010. Why vector clocks are hard. Basho Blog; 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":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898442.2917756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898442.2917756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:30Z","timestamp":1750222590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898442.2917756"}},"subtitle":["Sometimes all you need is the right language."],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1145\/2898442.2917756"],"URL":"https:\/\/doi.org\/10.1145\/2898442.2917756","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2016,1]]},"assertion":[{"value":"2016-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}