Efficient dependency tracking for relevant events in shared-memory systems
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient dependency tracking for relevant events in concurrent systems
Distributed Computing
Approximation of self-stabilizing vertex cover less than 2
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
| Hi-index | 0.01 |
In this paper, we present a new method of timestamping messages and events in synchronous computations that capture the order relationship with vectors of size less than or equal to the size of the vertex cover of the communication topology of the system. Our method is fundamentally different from that of Fidge and Mattern's technique. The timestamps in our method do not use one component per process but still guarantee that the order relationship is captured accurately. Our algorithm is online and only requires piggybacking of timestamps on program messages. It is applicable to all programs that either use programming languages based on synchronous communication such as CSP, or use synchronous remote procedure calls.