Why logical clocks are easy

Abstract

Sometimes all you need is the right language.

References

1. Ajoux, P., Bronson, N., Kumar, S., Lloyd, W., Veeraraghavan, K. Challenges to adopting stronger consistency at scale. In Proceedings of the 15^th Workshop on Hot Topics in Operating Systems, Kartause Ittingen, Switzerland. Usenix Association, 2015.
2. Almeida, P.S., Baquero, C., Gonçalves, R., Preguiça, N.M., Fonte, V. Scalable and accurate causality tracking for eventually consistent stores. In Proceedings of the Distributed Applications and Interoperable Systems, held as part of the Ninth International Federated Conference on Distributed Computing Techniques (Berlin, Germany, 2014), 67--81.
3. Birman, K.P., Joseph, T.A. Reliable communication in the presence of failures. ACM Transactions on Computer Systems 5, 1 (1987), 47--76.
4. Charron-Bost, B. Concerning the size of logical clocks in distributed systems. Information Processing Letters 39, 1 (1991), 11--16.
5. 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.
6. Fink, B. Why vector clocks are easy. Basho Blog, 2010; http://basho.com/posts/technical/why-vector-clocks-are-easy/.
7. 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.
8. Lamport, L. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21, 7 (1978), 558--565.
9. Lloyd, W., Freedman, M.J., Kaminsky, M., Andersen, D.G. Don't settle for eventual: Scalable causal consistency for wide-area storage with COPS. In Proceedings of the 23^rd ACM Symposium on Operating Systems Principles (New York, NY, 2011), 401--416.
10. 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.
11. Neville-Neil, G. Time is an illusion. acmqueue 13, 9 (2015). 57--72
12. Parker, D.S. et al. Detection of mutual inconsistency in distributed systems. IEEE Transactions on Software Engineering 9, 3 (1983), 240--247.
13. Preguiça, N.M., Baquero, C., Almeida, P.S., Fonte, V., Gonçalves, R. Brief announcement: Efficient causality tracking in distributed storage systems with dotted version vectors. In ACM Symposium on Principles of Distributed Computing. D. Kowalski and A. Panconesi, Eds. (2012), 335--336.
14. Schwarz, R., Mattern, F. Detecting causal relationships in distributed computations: in search of the Holy Grail. Distributed Computing 7, 3 (1994), 149--174.
15. Sheehy, J. Why vector clocks are hard. Basho Blog, 2010; http://basho.com/posts/technical/why-vector-clocks-are-hard/.
16. Sheehy, J. There is no now. acmqueue 13, 3 (2015), 20--27.

Index Terms

• Hardware

  • Integrated circuits

    • Reconfigurable logic and FPGAs

  • Very large scale integration design

    • Analog and mixed-signal circuits

      • Clock generation and timing