A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

Taheri, Hoda; Neamatollahi, Peyman; Naghibzadeh, Mahmoud

doi:10.1016/j.ipl.2011.05.021

Cited by 7 publications

(2 citation statements)

References 20 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]. Critical section (CS) is a code in which sharing of resources is done or accessed.…”

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

“…The use of logical structures is another popular approach to design message efficient distributed algorithms for dynamic networks. Recently, many mutual exclusion algorithms have been proposed that use logical structures, like the grid structure in [5], the two-dimensional array structure in [6,7], and the hypercube structure in [8].…”

Section: Introductionmentioning

confidence: 99%

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

Sharma¹,

Bhatia²,

Singh³

2014

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intracluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

show abstract

A simple token-based algorithm for the mutual exclusion problem in distributed systems

2017

View full text Add to dashboard Cite

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

Cited by 7 publications

References 20 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

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

A simple token-based algorithm for the mutual exclusion problem in distributed systems

Contact Info

Product

Resources

About