A distributed K-mutual exclusion algorithm

This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical sectio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of 15th International Conference on Distributed Computing Systems S. 153 - 160
Hauptverfasser: Bulgannawar, S., Vaidya, N.H.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1995
Schlagworte:
Delay
ISBN:9780818670251, 0818670258
ISSN:1063-6927
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The paper presents simulation results for the proposed algorithm and compares them with three other algorithms. Unlike previous work, our simulation model assumes that a finite (non-zero) overhead is encountered when a message is sent or received. The simulation results show that, as compared to other algorithms, the proposed algorithm achieves lower delay in entering critical section as well as lower number of messages, without a significant increase in the size of the messages.
AbstractList This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The paper presents simulation results for the proposed algorithm and compares them with three other algorithms. Unlike previous work, our simulation model assumes that a finite (non-zero) overhead is encountered when a message is sent or received. The simulation results show that, as compared to other algorithms, the proposed algorithm achieves lower delay in entering critical section as well as lower number of messages, without a significant increase in the size of the messages.
Author Bulgannawar, S.
Vaidya, N.H.
Author_xml – sequence: 1
  givenname: S.
  surname: Bulgannawar
  fullname: Bulgannawar, S.
  organization: Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
– sequence: 2
  givenname: N.H.
  surname: Vaidya
  fullname: Vaidya, N.H.
  organization: Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
BookMark eNotj0tLw0AURgesYK35AbrKWki8dybzWpZotbTQhbouk8wdHclD8gD99xbq6tscDue7Zouu74ixW4QcEezDtnwsX3O0VuYSALC4YInVBgwapYFLXLAlghKZslxfsWQcv04YSGk4l0t2v059HKchVvNEPt1l7TzNrknpp27mMfZd6pqPfojTZ3vDLoNrRkr-d8XeN09v5Uu2Pzxvy_U-iwjFlGlJvjZcQOUkWCqk8CJwXfigVB2Ct6idrf2pUYHTFSkHhEoRaCMCCCNW7O7sjUR0_B5i64bf4_mc-APrv0Oe
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICDCS.1995.500014
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 160
ExternalDocumentID 500014
GroupedDBID 23M
29G
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i104t-75edc8230ba509e453d3f274df66cffd917a9cd97860a7be6a0e166e0783f0383
IEDL.DBID RIE
ISBN 9780818670251
0818670258
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6927
IngestDate Tue Aug 26 21:45:52 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-75edc8230ba509e453d3f274df66cffd917a9cd97860a7be6a0e166e0783f0383
PageCount 8
ParticipantIDs ieee_primary_500014
PublicationCentury 1900
PublicationDate 19950000
PublicationDateYYYYMMDD 1995-01-01
PublicationDate_xml – year: 1995
  text: 19950000
PublicationDecade 1990
PublicationTitle Proceedings of 15th International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 1995
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558225
ssj0005863
Score 1.4092677
Snippet This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is...
SourceID ieee
SourceType Publisher
StartPage 153
SubjectTerms Delay
Title A distributed K-mutual exclusion algorithm
URI https://ieeexplore.ieee.org/document/500014
WOSCitedRecordID wos500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA22uHBVrRXfZOFKSJt55LWUalGUUlChu5Imd7TQdqTOiJ9vkpm2CG7czcwimSSE-zj3nIvQlUqiSJmYES2lJmmqNFHAgNgoFlPtkTkIIq5PYjiU47Ea1TrbgQsDAKH4DLr-MWD5NjelT5X1WPDoG6ghhKioWpt0CmVMxluZPcokr2rreUK4ikWQfvTibc7Gy1p4Z_0e1WhnRFXvoX_bf_YUPtatZvvVdSUYnUHrX7-7jzpb8h4ebczSAdqBZRu11t0bcH2ZD9H1DbZeNdc3vAKLH8mi9FwSDN9mXvocGtbzt3w1K94XHfQ6uHvp35O6cwKZufCqIIKBNR5Cm2rnEEDKEptkLv60Gecmy6yL0bQy1m0Cp1pMgWsKEefgMb2MuqD1CDWX-RKOEZYZJCm1LHYHmgplnEOg3ZBCxcy5KoyeoLZf-eSjEseYVIs-_fPrGdqrGOE-g3GOmsWqhAu0a76K2efqMhzoD7F_l38
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4omugJRYxv9-DJpNB9tLs9GpRAQEIiJtxIaWeVhIdB1vjzbbsLxMSLt909tNs2zTy--b4BuBOh7wsVMCKTRJIoEpIIZEi0H8RjaZE5dCKu3bjXS4ZD0S90th0XBhFd8RnW7KPD8vVCZTZVVmfOo9-FPRZFgZ-TtTYJFcpYEmyF9ihLeF5dz0PCRRA78Ucr32asfFJI76zf_QLv9KmotxuPjRdL4mO1fL5ffVec2WmW__XDR1Dd0ve8_sYwHcMOzitQXvdv8IrrfAL3D562urm25RVqr0NmmWWTePitppnNonly-rZYTlbvsyq8Np8GjRYpeieQiQmwViRmqJUF0cbSuAQYsVCHqYlAdcq5SlNtojQplDabwKmMx8glRZ9ztKheSk3Yegql-WKOZ-AlKYYR1SwwRxrFQhmXQJohYxEw46wweg4Vu_LRRy6PMcoXffHn11s4aA2eu6Nuu9e5hMOcH27zGVdQWi0zvIZ99bWafC5v3OH-AM04msY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+15th+International+Conference+on+Distributed+Computing+Systems&rft.atitle=A+distributed+K-mutual+exclusion+algorithm&rft.au=Bulgannawar%2C+S.&rft.au=Vaidya%2C+N.H.&rft.date=1995-01-01&rft.pub=IEEE&rft.isbn=9780818670251&rft.issn=1063-6927&rft.spage=153&rft.epage=160&rft_id=info:doi/10.1109%2FICDCS.1995.500014&rft.externalDocID=500014
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6927&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6927&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6927&client=summon