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.
Type de document :
[Research Report] RR-2395, INRIA. 1994
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:55:59
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:07:44



  • 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〉



Consultations de la notice


Téléchargements de fichiers