A hybrid distributed mutual exclusion algorithm

Chang, Youngho

doi:10.1016/0165-6074(96)00013-0

Cited by 3 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem with mutual exclusion which occurs is when some two or more processes or devices try to work at same instant of time simultaneously [1]. When they compete for the critical section at the same time, no one of the devices get chance to share resources, and none of them can't use it fruitfully [2,3,4].So, to prevent from this issue, a distributed algorithms is designed to manage the critical region [5].…”

Section: Introductionmentioning

confidence: 99%

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

Singh¹,

Naag²

2015

IJERT

View full text Add to dashboard Cite

In a distributed system several devices are connected to each other to share resources like software's or hardware's, which makes Mutual Exclusion essential for distributed system during the sharing process. The region where all the sharing takes place is the Critical region. Mutual Exclusion on Distributed system allows critical resource to be shared between different mobile nodes in a Mobile Ad-Hoc Network. In this the region is divided and in a logical way sharing is done. Critical section can be defined as a state when a node or device is actually sharing or using the resources which are required in the process of communicating with each other. A request is involved for making decision regarding that which node or device would enter critical section. This request can be made to neighboring nodes or by imposing any algorithm which can make it possible the sharing process to be fair for each node i.e. no node should wait for an infinite time for its turn or no node should get infinite access to resources. In this paper, several mutual exclusion algorithms are discussed by comparing their advantages and disadvantages. Section 1 includes the introduction of the Distributed Mutual Exclusion problem and its categories. In Section 2 the basic requirements for a system to attain mutual exclusion. In section 3 discussions of all the algorithms is covered.

show abstract

Section: Introductionmentioning

confidence: 99%

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

Singh¹,

Naag²

2015

IJERT

View full text Add to dashboard Cite

show abstract

State-of-the-Art Review

Kanrar¹,

Chaki

Chattopadhyay

2017

Concurrency Control in Distributed System Using Mutual Exclusion

View full text Add to dashboard Cite

A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion

Chang

Chang²

1997

SIGOPS Oper. Syst. Rev.

View full text Add to dashboard Cite

In the paper, we propose a dynamic triangular mesh protocol for mutual exclusion, in which the nodes in the system are organized into a triangular mesh. A quorum contains three dynamic paths in the given triangular mesh and the quorum size is k that is O (√ N ), where N is the number of nodes in the system and is equal to k ( k +1)/2. The protocol is fault-tolerant up to ( k - 1) site failures and communication failures in the worst case, even when such failures lead to network partitioning. From our simulation study, the proposed protocol can have higher availability and less quorum size than Cheung et al.'s grid protocol. Moreover, the quorum size of the proposed protocol will be less than that in Kumar's HQC protocol when N is greater than or equal to 15, and can be less than that in Agrawal et al.'s tree quorum protocol when node failures occur.

show abstract

A hybrid distributed mutual exclusion algorithm

Cited by 3 publications

References 11 publications

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

State-of-the-Art Review

A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion

Contact Info

Product

Resources

About