A new token based protocol for group mutual exclusion in distributed systems

Quazi Ehsanul Kabir Mamun*, Hidenori Nakazato

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this paper we present a new token based protocol for group mutual exclusion in distributed systems. The protocol uses one single token to allow multiple processes to enter the critical section for a common session. One of the significant characteristics of the protocol is - concurrency, throughput and waiting time can be regulated adjusting the time period for which a session is declared. The minimum and the maximum number of messages to enter the CS is O and (n + 2) respectively where n is the total number of processes in the system. Moreover, simulation results show that the protocol, on average case, considerably reduces the number of messages per entry to the CS and also requires much lower waiting times. The maximum concurrency the protocol supports is n. The protocol also ensures no starvation in the system. Furthermore, this algorithm works out for the Extended Group Mutual Exclusion problem as well.

Original languageEnglish
Title of host publicationProceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006
Pages34-41
Number of pages8
DOIs
Publication statusPublished - 2006 Dec 1
Event5th International Symposium on Parallel and Distributed Computing, ISPDC 2006 - Timisoara, Romania
Duration: 2006 Jul 62006 Jul 9

Publication series

NameProceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

Conference

Conference5th International Symposium on Parallel and Distributed Computing, ISPDC 2006
Country/TerritoryRomania
CityTimisoara
Period06/7/606/7/9

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'A new token based protocol for group mutual exclusion in distributed systems'. Together they form a unique fingerprint.

Cite this