Queue based mutual exclusion with linearly bounded overtaking

Hesselink, Wim H.; Aravind, Alex

doi:10.1016/j.scico.2010.11.002

Cited by 2 publications

(1 citation statement)

References 17 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This trend is primarily due to the ubiquitous use and the availability of single-chip multiprocessors or multicore processors. Following Dijkstra's algorithm, several solutions have been published in the literature to solve the mutual exclusion problem [1], [2], [13], [4], [11], [25], [30]. This paper proposes two new algorithms to solve the mutual exclusion problem.…”

Section: Introductionmentioning

confidence: 99%

Yet Another Simple Solution for the Concurrent Programming Control Problem

Aravind

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

As multicore processors are becoming increasingly common everywhere, the future computing systems and devices are becoming inevitably concurrent. Also, on the applications side, automation is steadily infiltrating into everyday life, and hence, most software systems are becoming increasingly complex and concurrent. As a result, recent developments and projections indicate that we are entering into the era of concurrent programming. Synchronizing asynchronous concurrent processes in accessing a shared resource is an important issue. Among the synchronization issues, mutual exclusion is fundamental. Solutions to most higher level synchronization problems rely on the assurance of mutual exclusion. Several algorithms with varying characteristics are proposed in the literature to solve the mutual exclusion problem. This paper presents two new algorithms to solve the mutual exclusion problem. The algorithms are simple and have many nice properties.

show abstract

Section: Introductionmentioning

confidence: 99%

Yet Another Simple Solution for the Concurrent Programming Control Problem

Aravind

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

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

Queue based mutual exclusion with linearly bounded overtaking

Cited by 2 publications

References 17 publications

Yet Another Simple Solution for the Concurrent Programming Control Problem

Yet Another Simple Solution for the Concurrent Programming Control Problem

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

Contact Info

Product

Resources

About