Abstract
Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated data. Version vectors do not have a bounded representation; they are based on integer counters that grow indefinitely as updates occur. Existing approaches to this problem are scarce; the mechanisms proposed are either unbounded or operate only under specific settings. This paper examines version vectors as a mechanism for data causality tracking and clarifies their role with respect to vector clocks. Then, it introduces bounded stamps and proves them to be a correct alternative to integer counters in version vectors. The resulting mechanism, bounded version vectors, represents the first bounded solution to data causality tracking between replicas subject to local updates and pairwise symmetrical synchronization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.B., Almeida, P.S., Baquero, C.: Bounded version vectors. Technical Report UMDITR2004.01, Departamento de Informática, Universidade do Minho (July 2004)
Almeida, P.S., Baquero, C., Fonte, V.: Version stamps – decentralized version vectors. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), pp. 544–551. IEEE Computer Society, Los Alamitos (2002)
Arora, A., Kulkarni, S.S., Demirbas, M.: Resettable vector clocks. In: 19th Symposium on Principles of Distributed Computing (PODC 2000), Portland, ACM, New York (2000)
Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Information Processing Letters 39, 11–16 (1991)
Fidge, C.: Timestamps in message-passing systems that preserve the partial ordering. In: 11th Australian Computer Science Conference, pp. 55–66 (1989)
Fischer, M.J., Michael, A.: Sacrificing serializability to attain high availability of data. In: Proceedings of the ACM Symposium on Principles of Database Systems, pp. 70–75. ACM, New York (1982)
Garg, V.K., Skawratananond, C.: String realizers of posets with applications to distributed computing. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 72–80. ACM, New York (2001)
Guy, R.G., Heidemann, J.S., Mak, W., Page, T., Popek, G.J., Rothmeier, D.: Implementation of the ficus replicated file system. In: USENIX Conference Proceedings, June 1990, pp. 63–71. USENIX (1990)
Huang, Y.-W., Yu, P.: Lightweight version vectors for pervasive computing devices. In: Proceedings of the 2000 International Workshops on Parallel Processing, pp. 43–48. IEEE Computer Society, Los Alamitos (2000)
Byung, B., Kang, H., Wilensky, R., Kubiatowicz, J.: The hash history approach for reconciling mutual inconsistency. In: Proceedings of the 23nd International Conference on Distributed Computing Systems (ICDCS), pp. 670–677. IEEE Computer Society, Los Alamitos (2003)
Kistler, J., Satyanarayanan, M.: Disconnected operation in the coda file system. ACM Transaction on Computer Systems 10(1), 3–25 (1992)
Lamport, L.: Time, clocks and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Mattern, F.: Virtual time and global clocks in distributed systems. In: Workshop on Parallel and Distributed Algorithms, pp. 215–226 (1989)
Parker, D.S., Popek, G., Rudisin, G., Stoughton, A., Walker, B., Walton, E., Chow, J., Edwards, D., Kiser, S., Kline, C.: Detection of mutual inconsistency in distributed systems. Transactions on Software Engineering 9(3), 240–246 (1983)
Ratner, D.H.: Roam: A Scalable Replication System for Mobile and Distributed Computing. PhD thesis, UCLA-CSD-970044 (1998)
Ruget, F.: Cheaper matrix clocks. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 355–369. Springer, Heidelberg (1994)
Saito, Y.: Unilateral version vector pruning using loosely synchronized clocks. Technical Report HPL-2002-51, HP Labs (2002)
Saito, Y., Shapiro, M.: Optimistic replication. Technical Report MSRTR-2003-60, Microsoft Research (2003)
Schwarz, R., Mattern, F.: Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing 3(7), 149–174 (1994)
Torres-Rojas, F.J., Ahamad, M.: Plausible clocks: constant size logical clocks for distributed systems. Distributed Computing 12(4), 179–196 (1999)
Wuu, G.T.J., Bernstein, A.J.: Efficient solutions to the replicated log and dictionary problems. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 1984), pp. 232–242. ACM, New York (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Almeida, J.B., Almeida, P.S., Baquero, C. (2004). Bounded Version Vectors. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive