By Topic

A wrong opinion about quorum generation algorithm for distributed mutual exclusion

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)
Mei-An Li ; Coll. of Comput. & Inf. Eng., Inner Mongolia Agric. Univ., Huhehaote, China ; Bu-Yu Wang ; Wei Li ; Dong Ma

All the quorum generation algorithms based on greedy algorithm before denotes that the number of nodes selected to insert the quorum should change from one to N0.5, and the time complexity should change from O (2N3.5) to O (N!). Based on this phenomenon, a reasonable supposition will be proposed as follow: When the number of nodes selected to insert in quorum once is belong with the natural number set of [1, N0.5], the quorum length should change in set of [N0.5, 2 N0.5]and the time complexity of the quorum generation algorithm should change in the natural number set of [O (2N3.5), O (N!)]. And along with the number of nodes selected to insert in quorum once increasing, the quorum length will change from 2 N0.5 to N0.5, and the time complexity of the quorum generation algorithm should change from O(2N3.5) to O (N!). The quorum generation algorithm with k-nodes selected based on greedy algorithm has been designed to prove the supposition. And the outcome from k-nodes quorum generation algorithm and the analysis to the algorithm denote that the supposition is wrong.

Published in:

Apperceiving Computing and Intelligence Analysis, 2009. ICACIA 2009. International Conference on

Date of Conference:

23-25 Oct. 2009