Interested? Intrigued? Something to report?
Feel free to get in touch with us.
Concept, Organization, Back-end Bugs
Design, Front-end Bugs
Please talk to your local organizers instead. There's a link to their email address on the About page.
This one’s for you, Cliff.
Don’t forget to lean into it.
Timestamps in Message-Passing Systems That Preserve the Partial Ordering
by Colin J. 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 message-passing programs that allow for access to the partial ordering inherent in a parallel system. The algorithms do not hcnage the communications graph or require a central timestamp issuing authority.