HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

An Implementation of Global Flush Primitives Using Counters

M. Ahuja 1 Michel Raynal 2
2 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:55:59 PM
Last modification on : Friday, February 4, 2022 - 3:24:01 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:07:44 AM


  • HAL Id : inria-00074280, version 1


M. Ahuja, Michel Raynal. An Implementation of Global Flush Primitives Using Counters. [Research Report] RR-2395, INRIA. 1994. ⟨inria-00074280⟩



Record views


Files downloads