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. We discuss the benefits and the constraints of the proposed approach.
Liste complète des métadonnées

https://hal.inria.fr/inria-00001140
Contributor : Sébastien Monnet <>
Submitted on : Monday, March 6, 2006 - 11:28:56 AM
Last modification on : Friday, November 16, 2018 - 1:21:58 AM
Document(s) archivé(s) le : Saturday, April 3, 2010 - 8:17:43 PM

Identifiers

  • HAL Id : inria-00001140, version 1

Citation

Gabriel Antoniu, Loïc Cudennec, Sébastien Monnet. Extending the entry consistency model to enable efficient visualization for code-coupling grid applications. CCGrid 2006, May 2006, Singapore, Japan. pp.552-555. ⟨inria-00001140⟩

Share

Metrics

Record views

361

Files downloads

153