Timestamping events for inferring 'affects' relation and potential causality
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors define a relation, 'affects', between every pair of events based on a relation 'locally affects' for each process between each pair of events on the process. A mechanism for timestamping events is defined such that 'affects' relation, and so potential concurrency, between events can be inferred from their timestamps. A timestamping mechanism is presented such that potential concurrency can be inferred partially/completely and the extent of such inferring depends on the costs associated with the mechanism. Inferring 'affects' relationship can be used for debugging and for inferring potential concurrency between events in traces of executions.<>Keywords
This publication has 7 references indexed in Scilit:
- An implementation of F-channels, a preferable alternative to FIFO channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Recovery in distributed systems using optimistic message logging and checkpointingJournal of Algorithms, 1990
- Flush primitives for asynchronous distributed systemsInformation Processing Letters, 1990
- Partial orders for parallel debuggingPublished by Association for Computing Machinery (ACM) ,1988
- Substituting for real time and common knowledge in asynchronous distributed systemsPublished by Association for Computing Machinery (ACM) ,1987
- How processes learnDistributed Computing, 1986
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978