Replay Clocks
Pages 114 - 123
Abstract
In this work, we focus on the problem of replay clocks (RepCl). The need for replay clocks arises from the observation that analyzing distributed computation for all desired properties of interest may not be feasible in an online environment. These properties can be analyzed by replaying the computation. However, to be beneficial, such replay must account for all the uncertainty that is possible in a distributed computation. Specifically, if event e must occur before f then the replay clock must ensure that e is replayed before f. On the other hand, if e and f could occur in any order then replay should not force an order between them.
After identifying the limitations of existing clocks to provide the replay primitive, we present RepCl and identify an efficient representation for the same. We demonstrate that RepCl can be implemented with less than four integers for 64 processes for various system parameters if clocks are synchronized within 1ms. Furthermore, the overhead of RepCl (for computing/comparing timestamps and message size) is proportional to the size of the clock. Using simulations, we identify the expected overhead of RepCl based on the given system settings. We also identify how a user can the identify feasibility region for RepCl. Specifically, given the desired overhead of RepCl, it identifies the region where unabridged replay is possible.
References
[1]
Ivan Beschastnikh, Patty Wang, Yuriy Brun, and Michael D Ernst. 2016. Debugging distributed systems. Commun. ACM 59, 8 (2016), 32–37.
[2]
Colin J Fidge. 1988. Timestamps in message-passing systems that preserve the partial ordering. In Proceedings of the 11th Australian Computer Science Conference (ACSC), Kerry Raymond (Ed.). 56–66.
[3]
Jerry Fowler and Willy Zwaenepoel. 1990. Causal distributed breakpoints. Proceedings.,10th International Conference on Distributed Computing Systems (1990), 134–141.
[4]
Sandeep S Kulkarni, Gabe Appleton, and Duong Nguyen. 2022. Achieving Causality with Physical Clocks. In Proceedings of the 23rd International Conference on Distributed Computing and Networking (Delhi, AA, India) (ICDCN ’22). Association for Computing Machinery, New York, NY, USA, 97–106. https://doi.org/10.1145/3491003.3491009
[5]
Sandeep S Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, and Marcelo Leone. 2014. Logical physical clocks. In Principles of Distributed Systems: 18th International Conference, OPODIS 2014, Cortina d’Ampezzo, Italy, December 16-19, 2014. Proceedings 18. Springer, 17–32.
[6]
Ishaan Lagwankar and Sandeep S Kulkarni. 2023. Replay Clocks. arxiv:2311.07842 [cs.DC]
[7]
Leslie Lamport. 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21, 7 (July 1978), 558–565. https://doi.org/10.1145/359545.359563
[8]
Friedemann Mattern 1988. Virtual time and global states of distributed systems. Univ., Department of Computer Science.
[9]
D. L. Mills. 1985. Network Time Protocol (NTP). RFC 958. RFC Editor.
[10]
David L Mills. 1991. Internet time synchronization: the network time protocol. IEEE Transactions on communications 39, 10 (1991), 1482–1493.
[11]
Benjamin H Sigelman, Luiz André Barroso, Mike Burrows, Pat Stephenson, Manoj Plakal, Donald Beaver, Saul Jaspan, and Chandan Shanbhag. 2010. Dapper, a large-scale distributed systems tracing infrastructure. (2010).
[12]
Mukesh Singhal and Ajay D. Kshemkalyani. 1992. An Efficient Implementation of Vector Clocks. Inf. Process. Lett. 43, 1 (1992), 47–52. https://doi.org/10.1016/0020-0190(92)90028-T
[13]
Sorrachai Yingchareonthawornchai, Duong N Nguyen, Sandeep S Kulkarni, and Murat Demirbas. 2018. Analysis of bounds on hybrid vector clocks. IEEE Transactions on Parallel and Distributed Systems 29, 9 (2018), 1947–1960.
Index Terms
- Replay Clocks
Recommendations
Achieving Causality with Physical Clocks
ICDCN '22: Proceedings of the 23rd International Conference on Distributed Computing and NetworkingPhysical clocks provide more precision than applications can use. For example, a 64 bit NTP clock allows a precision of 233 picoseconds. In this paper, we focus on whether the least significant bits that are not useful to the applications could be used ...
Time, clocks, and the ordering of events in a distributed system
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally ...
On reducing the complexity of matrix clocks
Matrix clocks are a generalization of the notion of vector clocks that allows the local representation of causal precedence to reach into an asynchronous distributed computation's past with depth x, where x ≥ 1 is an integer. Maintaining matrix clocks ...
Comments
Information & Contributors
Information
Published In
January 2024
423 pages
ISBN:9798400716737
DOI:10.1145/3631461
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 January 2024
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICDCN '24
ICDCN '24: International Conference on Distributed Computing and Networking
January 4 - 7, 2024
Chennai, India
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 33Total Downloads
- Downloads (Last 12 months)30
- Downloads (Last 6 weeks)2
Reflects downloads up to 20 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format