An Implementation of Global Flush Primitives Using Counters
Résumé
We present an implementation of \gfp\ using counters. This implementation costs comparable to the most lightweight implementation of causal ordering. Thus, at a comparable cost, the presented implementation enriches functionality compared to causal ordering; as \gfp\ permit making an assertion about messages sent in the past of sending \im, in the future of sending \im, about both, or neither, where the past and the future of an event is defined using the relation ''happened before.'' Using \gfp, a message can be sent to any subset of processes specified as a parameter.