Design and topological analysis of probabilistic distributed mutual exclusion algorithm with unbiased refined ordering

• Published in: Future generation computer systems Vol. 95; pp. 175 - 186
• Main Author: Bagchi, Susmit
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.06.2019
• Subjects: Distributed computing; Logical clock; Mutual exclusion; Probability; Random variable; Topological spaces; Probability; Mutual exclusion; Distributed computing; Logical clock; Random variable; Topological spaces
• ISSN: 0167-739X; 1872-7115
• DOI: 10.1016/j.future.2018.12.069

The applications of distributed computing systems are pervasive in nature involving multiple shared resources. The distributed mutual exclusion algorithms of various classes are employed to control concurrency of accessing shared resources maintaining data consistency. In general, the distributed mutual exclusion algorithms are designed based on fixed or dynamic graph structures formed by a set of processes, where the distributed mutual exclusion mechanisms are realized depending upon timestamp based ordering of events or by employing token circulation in the graph. On the contrary, in large scale heterogeneous distributed systems, an aggregate set of processes can be generated under special circumstances, where processes in a group are equally eligible to enter into critical section. In order to maintain safety and liveness properties of mutual exclusion in such cases, the probabilistic characterization as well as topological analysis of aggregate set in computing space is necessary. This paper proposes a probabilistic algorithm and its topological characterization for mutual exclusion in aggregate set of processes. The analysis of failure model of strictly ordered distributed inclusion–exclusion designs is constructed in the presence of aggregate set. The unbiased probabilistic algorithm is based on two-phased elastic randomization. The algorithm is evaluated through detailed simulation and, the related probabilistic characterization in topological subspace is evaluated. A detailed comparative analysis of the algorithm with respect to other distributed mutual exclusion algorithms is presented. •Distributed mutual inclusion–exclusion failure analysis and algorithm.•Probabilistic algorithm for refined distributed mutual exclusion.•Refined ordered probabilistic distributed mutual exclusion algorithm.