Madhavan Mukund, Gautham Shenoy R and S P Suresh
Proc. ACSS 2020, Springer Advances in Intelligent Systems and Computing 1178 (2020), 31-42.
© Springer-Verlag Berlin Heidelberg
Version Vectors constitute an essential feature of distributed systems that enables the computing elements to keep track of causality between the events of the distributed systems. In this article, we study a variant named Bounded Version Vectors. We define the semantics of version vectors using the framework of Mazurkiewicz traces. We use these semantics along with the solution for the gossip problem to come up with a succinct bounded representation of version vectors in distributed environments where replicas communicate via pairwise synchronization.