Extending the entry consistency model to enable efficient visualization for code-coupling grid applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

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

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5813.pdf (267.15 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070211 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070211 , version 1

Cite

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⟩
131 View
144 Download

Share

Gmail Facebook Twitter LinkedIn More