AN IMPLEMENTATION OF GLOBAL FLUSH PRIMITIVES USING COUNTERS
- 1 June 1995
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 05 (02) , 171-178
- https://doi.org/10.1142/s0129626495000151
Abstract
We present an implementation of Global-Flush Primitives 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 Global-Flush Primitives permit making an assertion about messages sent in the past of sending m, in the future of sending m, about both, or neither, where the past and the future of an event is defined using the relation "happened before." Using Global-Flush, a message can be sent to any subset of processes specified as a parameter.Keywords
This publication has 0 references indexed in Scilit: