Timestamping messages and events in a distributed system using synchronous communication

DOI10.1007/s00446-006-0018-5zbMath1266.68025OpenAlexW2080104754MaRDI QIDQ1954214

Chakarat Skawratananond, Vijay K. Garg, Neeraj Mittal

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0018-5

zbMATH Keywords

vertex coveredge decompositionsynchronous communicationvector clockstimestamping messages and events

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• The rank of a distributive lattice
• An efficient implementation of vector clocks
• A decomposition theorem for partially ordered sets
• String realizers of posets with applications to distributed computing
• The Complexity of the Partial Order Dimension Problem
• Time, clocks, and the ordering of events in a distributed system
• Efficient dependency tracking for relevant events in shared-memory systems
• Partially Ordered Sets

This page was built for publication: Timestamping messages and events in a distributed system using synchronous communication