The Average Message Complexity Analysis for Different Distributed Mutual Exclusion Site-Tolerant Ways

Abstract:

Article Preview

Many schemes have been proposed to implementation the distributed mutual exclusion. All those algorithms or schemes can be dived into two types based on the fault-tolerant operation. To any type algorithm, the size of the intersection of any two quorums will impact the number of average messages exchanged per Critical Section (CS) execution importantly if the sites are not always operational. In this paper, Basing on the discussions about the average messages in different cases of different algorithms, we get the average messages in the two types algorithm have the same monotony properties to k. and when N and k are all constants, the average messages functions are monotony descend to p. The average messages are more when k=1 than k=N if p is small enough. The minimum of the average messages is When p=1.

Info:

Periodical:

Advanced Materials Research (Volumes 171-172)

Edited by:

Zhihua Xu, Gang Shen and Sally Lin

Pages:

675-678

DOI:

10.4028/www.scientific.net/AMR.171-172.675

Citation:

M. A. Li et al., "The Average Message Complexity Analysis for Different Distributed Mutual Exclusion Site-Tolerant Ways", Advanced Materials Research, Vols. 171-172, pp. 675-678, 2011

Online since:

December 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.