Timestamps in Message-Passing Systems That Preserve the Partial Ordering

@inproceedings{ColinTimestampsIM,
  title={Timestamps in Message-Passing Systems That Preserve the Partial Ordering},
  author={Colin and Fidge}
}
Timestamping is a common method of totally ordering events in concurrent programs. However, for applications requiring access to the global state, a total ordering is inappropriate. This paper presents algorithms for timestamping events in both synchronous and asynchronous n1essage-passing programs that allow for access to the partial ordering inherent in a parallel system. The algorithms do not change the con1munications graph or require a central timestamp issuing authority. 
Highly Influential
This paper has highly influenced 32 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 633 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
382 Citations
1 References
Similar Papers

Citations

Publications citing this paper.

633 Citations

0204060'88'94'01'08'15
Citations per Year
Semantic Scholar estimates that this publication has 633 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Development of a Debugger for a Concurrent Language

  • N. DE FRANCESCO, G. VAGLINI
  • IEEE Transactions on Software Engineering
  • 1986

Similar Papers

Loading similar papers…