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

• Published in: 2009 International Conference on High Performance Computing and Simulation pp. 122 - 130
• Main Authors: Ortiz, A., Thiebolt, F., Jorda, J., M'zoughi, A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2009
• Subjects: Concurrent computing; Delay; Distributed algorithms; File servers; File systems; Grid; Middleware; Multicast; Multicast algorithms; Mutual exclusion; Network servers; Network topology; Testing
• ISBN: 1424449065; 9781424449064
• DOI: 10.1109/HPCSIM.2009.5192832

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.