You can view the full text of this article for free using the link below.

Title: A new resource sharing protocol in the light of token-based strategy for distributed system

Authors: Ashish Singh Parihar; Swarnendu Kumar Chakraborty

Addresses: Department of Computer Science and Engineering, National Institute of Technology (NIT), Arunachal Pradesh, India; Department of Computer Science, KIET Group of Institutions, Delhi-NCR, Ghaziabad, Uttar Pradesh, India ' Department of Computer Science and Engineering, National Institute of Technology (NIT), Arunachal Pradesh, India

Abstract: One of the highly researched areas in distributed system is mutual exclusion. To avoid any inconsistent state of system, more than one processes executing on different processors are not allowed to invoke their critical sections simultaneously for the purpose of resource sharing. As a solution to such resource allocation issues, token-based strategy for distributed mutual exclusion algorithms as a prime classification of solutions is one of the most popular and significant ways to handle mutual exclusion in this field. Through this research article, we propose a novel token-based distributed mutual exclusion algorithm. The proposed solution is scalable and has better results in terms of message complexity compared to existing solutions. In this proposed art of work, the numbers of messages exchange per critical section invocation are 3(⌈log N⌉ - 1), 3⌈(⌈log (N + 1) ⌉ - 1)/2⌉ and 6[⌈log (N + 1)⌉ + 2(2(-⌈log (N+1)⌉) - 1)] in case of light load, medium load and high load situations respectively.

Keywords: distributed system; mutual exclusion; critical section; token-based; resource allocation.

DOI: 10.1504/IJCSE.2023.129149

International Journal of Computational Science and Engineering, 2023 Vol.26 No.1, pp.78 - 89

Received: 21 May 2021
Accepted: 01 Nov 2021

Published online: 23 Feb 2023 *

Full-text access for editors Full-text access for subscribers Free access Comment on this article