Skip to Main content Skip to Navigation

Extending the entry consistency model to enable efficient visualization for code-coupling grid applications

Gabriel Antoniu 1 Loïc Cudennec 1 Sébastien Monnet 1
1 PARIS - Programming distributed parallel systems for large scale numerical simulation
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, ENS Cachan - École normale supérieure - Cachan, Inria Rennes – Bretagne Atlantique
Abstract : This paper addresses the problem of efficient visualization of shared data within code coupling grid applications. These applications are structured as a set of distributed, autonomous, weakly-coupled codes. We focus on the case where the codes are able to interact using the abstraction of a shared data space. We propose an efficient visualization scheme by adapting the mechanisms used to maintain the data consistency. We introduce a new operation called relaxed read, as an extension to the entry consistency model. This operation can efficiently take place without locking, in parallel with write operations. On the other hand, the user has to relax the consistency constraints, and accept slightly older versions of the data, whose « freshness » can however still be controlled. This approach has been implemented within the grid data-sharing service, and its efficiency is clearly demonstrated by our preliminary experimental results.
Document type :
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:30:30 PM
Last modification on : Monday, February 15, 2021 - 10:42:45 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:36:51 PM


  • HAL Id : inria-00070211, version 1


Gabriel Antoniu, Loïc Cudennec, Sébastien Monnet. Extending the entry consistency model to enable efficient visualization for code-coupling grid applications. [Research Report] RR-5813, INRIA. 2006, pp.17. ⟨inria-00070211⟩



Record views


Files downloads