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

Quazi Ehsanul Kabir Mamun, Hidenori Nakazato

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

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.

元の言語English
ホスト出版物のタイトルProceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006
ページ34-41
ページ数8
DOI
出版物ステータスPublished - 2006 12 1
イベント5th International Symposium on Parallel and Distributed Computing, ISPDC 2006 - Timisoara, Romania
継続期間: 2006 7 62006 7 9

出版物シリーズ

名前Proceedings - Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006

Conference

Conference5th International Symposium on Parallel and Distributed Computing, ISPDC 2006
Romania
Timisoara
期間06/7/606/7/9

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Hardware and Architecture

フィンガープリント 「A new token based protocol for group mutual exclusion in distributed systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル