ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2…N ÿ 1† messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...

A linked list is used to speed up a mutual exclusion algorithm. This optimization permits additional concurrency by allowing scans of the list to be concurrent with insertions and deletions of list entries.

This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...

Recent research on mutual exclusion for shared-memory systems has focused on local spinalgorithms. Performance is measured using the remote memory references (RMRs) metric. Ascommon in recent literature, we consider a standard asynchronous shared memory model withN processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.In such a model, the asympt...

A concurrent application consists of a set of concurrently executing interacting processes. Although earlier we proposed work automata to specify both computation and interaction of such a set of executing processes, a detailed formal semantics for them was left implicit. In this paper, we provide a formal semantics for work automata, based on which we introduce equivalences such as weak simula...

Article history: Received 1 December 2007 Received in revised form 11 November 2008 Accepted 14 November 2008

In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the n...

This paper provides an introduction to the Automatic Mutual Exclusion (AME) programming model and to its formal study, through the AME calculus. AME resembles cooperative multithreading; in the intended implementations, however, software transactional memory supports the concurrent execution of atomic fragments. This paper also studies simple dynamic and static mechanisms for atomicity checks i...

The group mutual exclusion (GME) problem deals with sharing a set of (m) mutually exclusive resources among all (n) processes of a network. Processes are allowed to be in a critical section simultaneously provided they request the same resource. We present three group mutual exclusion solutions for tree networks. All three solutions do not use process identifiers, and use bounded size messages....

Multiprocessing systems are programmed cleanly using Critical sections. When a process desires to access some shared data it first gets mutual exclusive access to critical sections for reliable outcome as processes may possibly manipulate the data. This paper presents an algorithm that can solve the problem in single processing, multiprocessing and distributed systems efficiently with minimal c...