A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems

Authors:
Faraneh Zarafshan;Abbas Karimi;S. A. R. Al-Haddad;M. Iqbal Saripan;Shamala Subramaniam
Affiliations:
Department of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, Malayasia and Department of Computer Engineering, Faculty of Engineering, IAU-Arak Branch, Iran;Department of Computer Engineering, Faculty of Engineering, IAU-Arak Branch, Iran;Department of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, Malayasia;Department of Computer and Communication Systems Engineering, Faculty of Engineering, UPM, Malayasia;Department of Communication Technology & Networks, Faculty of Computer Science and IT, UPM, Malayasia
Venue:
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
Year:
2011

Citing 14
Cited 0

Dynamic voting

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A Dynamic Voting Scheme in Distributed Systems

IEEE Transactions on Software Engineering
A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Increasing availability under mutual exclusion constraints with dynamic vote reassignment

ACM Transactions on Computer Systems (TOCS)
Dynamic voting algorithms for maintaining the consistency of a replicated database

ACM Transactions on Database Systems (TODS)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting

IEEE Transactions on Knowledge and Data Engineering
A New Dynamic Voting Algorithm for Distributed Database Systems

IEEE Transactions on Knowledge and Data Engineering
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms

Computer Standards & Interfaces
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Decentralized weighted voting for P2P data management

Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mutual exclusion as one of the main problems associated with distributed systems requires that at any time t, only one site can access the common copies of file f. As a result of node or link failures, distributed system may be partitioned into two or more groups of nodes which cannot communicate each other anymore; meanwhile they must be able to update their copies of file f consistently, in order to keep the system up. Voting algorithms are the main solutions presented to maintain mutual exclusion in case of distributed system partitioning. So far several techniques have been presented to increase the availability of mutual exclusion in partitioned distributed systems. In this paper a new dynamic voting approach called as ancestral voting is presented to increase the availability of distributed system. Our analyses show that this algorithm can maintain mutual exclusion and increase the availability of distributed system between 2.86% and 59.83% in comparison with previous algorithms. Furthermore, it is very simple and does not need many calculations.