Group k-mutual exclusion for distributed systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 nodes to have identifications. The delay and session switches of the proposed algorithm are Ω(n2) and Ω(n), respectively.

Original languageEnglish
Title of host publicationProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Sytems
EditorsT. Gonzalez
Pages140-145
Number of pages6
Edition1
StatePublished - 2003
EventProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems - Marina del Rey, CA, United States
Duration: 3 Nov 20035 Nov 2003

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Number1
Volume15

Conference

ConferenceProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
Country/TerritoryUnited States
CityMarina del Rey, CA
Period3/11/035/11/03

Keywords

  • Concurrency
  • Distributed systems
  • Group mutual exclusion
  • k-mutual exclusion
  • Mutual exclusion
  • Tokens

Fingerprint

Dive into the research topics of 'Group k-mutual exclusion for distributed systems'. Together they form a unique fingerprint.

Cite this