By Topic

How to use multicast in distributed mutual exclusion algorithms for grid file systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ortiz, A. ; IRIT, Inst. de Rech. en Inf. de Toulouse, Univ. Paul Sabatier Toulouse III, Toulouse, France ; Thiebolt, F. ; Jorda, J. ; M'zoughi, A.

In a file system, critical sections are represented by means of read or write operations on useful data (i.e files) as well as metadata of the system. The processes must be synchronized to reach these shared resources, thanks to mutual exclusion algorithms which guarantee data consistency. In a grid environment, processes are compared to grid nodes and their synchronization is ensured by the sending of messages on the network. Moreover, the access time to a critical section is conditioned by the high latency of the network. In this paper, we propose a method based on the use of the multicast, which makes it possible in some cases to decrease the access time to critical sections. This solution was implemented within a token- and tree-based distributed mutual exclusion algorithm and it was integrated in the grid middleware named ViSaGe.

Published in:

High Performance Computing & Simulation, 2009. HPCS '09. International Conference on

Date of Conference:

21-24 June 2009