Manuel Bravo
ABSTRACT
In this paper, we introduce a technique that can be used by distributed transactional protocols to reduce the vulnerability window of transactions. For this purpose, we propose a so far unexplored (to the best of our knowledge) usage of hybrid clocks. On one hand, loosely synchronized physical clocks are used to maximize the freshness of the snapshots used by transactions to read. On the other hand, logical clocks are used to reduce the extent to which the snapshot of update transactions is advanced upon their commit.
We claim that the joint usage of these two techniques can potentially reduce the abort rate in comparison to previous protocols such as Clock-SI, GMU, and SCORe.
References
- Cockroach. https://github.com/cockroachdb/cockroach.Google Scholar
- IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. IEEE Std 1588-2002, pages i--144, 2002.Google Scholar
- P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Boston, MA, USA, 1987. Google Scholar
- J. Du, S. Elnikety, and W. Zwaenepoel. Clock-si: Snapshot isolation for partitioned data stores using loosely synchronized clocks. In SRDS '13, pages 173--184, Sept 2013. Google Scholar
- A. Fekete, D. Liarokapis, E. O'Neil, P. O'Neil, and D. Shasha. Making snapshot isolation serializable. ACM Trans. Database Syst., 30(2): 492--528, June 2005. Google Scholar
- C. J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. 1987.Google Scholar
- S. Kulkarni, M. Demirbas, D. Madappa, B. Avva, and M. Leone. Logical physical clocks. In Principles of Distributed Systems, volume 8878 of Lecture Notes in Computer Science, pages 17--32. 2014.Google Scholar
- L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7): 558--565, July 1978. Google Scholar
- F. Mattern. Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, 1(23): 215--226, 1989.Google Scholar
- D. L. Mills. A brief history of ntp time: Memoirs of an internet timekeeper. ACM SIGCOMM Computer Communication Review, 33 (2): 9--21, 2003. Google Scholar
- S. Peluso, P. Romano, and F. Quaglia. Score: A scalable one-copy serializable partial replication protocol. In Proceedings of the 13th International Middleware Conference, Middleware '12, pages 456--475, New York, NY, USA, 2012. Google Scholar
- S. Peluso, P. Ruivo, P. Romano, F. Quaglia, and L. Rodrigues. When scalability meets consistency: Genuine multiversion update-serializable partial data replication. In ICDCS '12, pages 455--465, June 2012. Google Scholar
- S. K. Sarin and N. A. Lynch. Discarding obsolete information in a replicated database system. Software Engineering, IEEE Transactions on, (1): 39--47, 1987. Google Scholar
- N. Schiper, P. Sutra, and F. Pedone. P-store: Genuine partial replication in wide area networks. In SRDS '10, pages 214--224, Washington, DC, USA, 2010. Google Scholar
- D. Sciascia, F. Pedone, and F. Junqueira. Scalable deferred update replication. In Proceedings of the 2012 42Nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), DSN '12, pages 1--12, Washington, DC, USA, 2012. Google Scholar
- G. T. Wuu and A. J. Bernstein. Efficient solutions to the replicated log and dictionary problems. In Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 233--242. ACM, 1984. Google Scholar
Index Terms
Reducing the vulnerability window in distributed transactional protocols
Comments