By Topic

A Broadcast Fault-Tolerant Hierarchical Token-Based Mutual Exclusion Algorithm

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
$33 $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)
Yasser Mansouri ; Department of Computer Science and Engineering, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran, E-mail: ya ; Mohammad Moallemi ; Amin Rasoulifard ; Hossain Deldari

Fault tolerance is a key feature for every grid based algorithm. In this paper we have proposed a fault tolerance technique for hierarchical mutual exclusion problem solver algorithm. This algorithm is based on Naimi-Trehel's token-based mutual exclusion algorithm. Our algorithm uses some intra cluster broadcasts to achieve this end and tolerate N-l permanent crashes of N nodes. We have also proposed a sketch of the proof for our algorithm and its integrity.

Published in:

2007 International Conference on Information and Communication Technology

Date of Conference:

7-9 March 2007