Advertisement

Biased Clocks: A Novel Approach to Improve the Ability To Perform Predicate Detection with O(1) Clocks

  • Vidhya Tekken ValapilEmail author
  • Sandeep Kulkarni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11085)

Abstract

In this paper, we present the notion of biased hybrid logical clocks (\(BHLC\)). These clocks are intended to improve the ability of a distributed system to perform predicate detection with just O(1) sized clocks. In traditional logical clocks (or hybrid logical clocks, their extension), the only way to guarantee that two events are concurrent is by checking if their clock values are equal. By contrast, biased clocks provide a window where this guarantee is provided. We validate our intuition that these biased clocks substantially improve the ability to successfully detect a given predicate with just O(1) sized clock. In particular, for many scenarios, we show that biased clocks improve the ability to detect predicates by 100–200 times when compared to standard hybrid logical clocks.

References

  1. 1.
    Bauer, A., Falcone, Y.: Decentralised LTL monitoring. Form. Methods Syst. Des. 48(1–2), 46–93 (2016)CrossRefGoogle Scholar
  2. 2.
    Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39(1), 11–16 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Chase, C.M., Garg, V.K.: Detection of global predicates: techniques and their limitations. Distrib. Comput. 11(4), 191–201 (1998)CrossRefGoogle Scholar
  4. 4.
    Chauhan, H., Garg, V.K.: Fast detection of stable and count predicates in parallel computations. In: Aspnes, J., Bessani, A., Felber, P., Leitão, J. (eds.) 21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, 18–20 December 2017. LIPIcs, vol. 95, pp. 20:1–20:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)Google Scholar
  5. 5.
    Chauhan, H., Garg, V.K., Natarajan, A., Mittal, N.: A distributed abstraction algorithm for online predicate detection. In: Proceedings of the 2013 IEEE 32nd International Symposium on Reliable Distributed Systems, SRDS 2013, pp. 101–110. IEEE Computer Society, Washington, DC (2013)Google Scholar
  6. 6.
    Fidge, C.J.: Timestamps in message-passing systems that preserve the partial ordering. In: Proceedings of the 11th Australian Computer Science Conference, vol. 10(1), pp. 56–66 (1988)Google Scholar
  7. 7.
    Garg, V.K.: Brief announcement: applying predicate detection to the stable marriage problem. In: Richa, A.W. (ed.) 31st International Symposium on Distributed Computing, DISC 2017, Vienna, Austria, 16–20 October 2017. LIPIcs, vol. 91, pp. 52:1–52:3. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)Google Scholar
  8. 8.
    Garg, V.K., Waldecker, B.: Detection of weak unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst. 5(3), 299–307 (1994)CrossRefGoogle Scholar
  9. 9.
    Kulkarni, S.S., Demirbas, M., Madappa, D., Avva, B., Leone, M.: Logical physical clocks. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 17–32. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-14472-6_2CrossRefGoogle Scholar
  10. 10.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)CrossRefGoogle Scholar
  11. 11.
    Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, pp. 215–226. North-Holland (1989)Google Scholar
  12. 12.
    Mostafa, M., Bonakdarpour, B.: Decentralized runtime verification of LTL specifications in distributed systems. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, 25–29 May 2015, pp. 494–503 (2015)Google Scholar
  13. 13.
    Natarajan, A., Chauhan, H., Mittal, N., Garg, V.K.: Efficient abstraction algorithms for predicate detection. Theor. Comput. Sci. 688, 24–48 (2017)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Schwarz, R., Mattern, F.: Detecting causal relationships in distributed computations: in search of the holy grail. Distrib. Comput. 7(3), 149–174 (1994)CrossRefGoogle Scholar
  15. 15.
    Sen, K., Vardhan, A., Agha, G., Rosu, G.: Efficient decentralized monitoring of safety in distributed systems. In: 26th International Conference on Software Engineering (ICSE 2004), 23–28 May 2004, Edinburgh, United Kingdom, pp. 418–427 (2004)Google Scholar
  16. 16.
    Stoller, S.D.: Detecting global predicates in distributed systems with clocks. Distrib. Comput. 13(2), 85–98 (2000)CrossRefGoogle Scholar
  17. 17.
    Yingchareonthawornchai, S., Nguyen, D.N., Tekken Valapil, V., Kulkarni, S.S., Demirbas, M.: Precision, recall, and sensitivity of monitoring partially synchronous distributed systems. In: Falcone, Y., Sánchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 420–435. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-46982-9_26CrossRefGoogle Scholar
  18. 18.
    Yingchareonthawornchai, S., Tekken Valapil, V., Kulkarni, S., Torng, E., Demirbas, M.: Efficient algorithms for predicate detection using hybrid logical clocks. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, ICDCN 2017, pp. 10:1–10:10. ACM, New York (2017)Google Scholar
  19. 19.
    Zhu, W., Cao, J., Raynal, M.: Predicate detection in asynchronous distributed systems: a probabilistic approach. IEEE Trans. Comput. 65(1), 173–186 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Michigan State UniversityEast LansingUSA

Personalised recommendations