An Implementation of Global Flush Primitives Using CountersReport as inadecuate




An Implementation of Global Flush Primitives Using Counters - Download this document for free, or read online. Document in PDF available to download.

1 CSE-UCSD - Department of Computer Science and Engineering San Diego 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.

Keywords : PARALLEL MACHINES HIGH-PERFORMANCE COMPUTING AND COMMUNICATION ASYNCHRONOUS DISTRIBUTED PROGRAMMING SYSTEMS EFFICIENCY SYNCHRONIZATION





Author: M. Ahuja - Michel Raynal -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents