Paper Info
Title
Distributed algorithm for K-entries to critical section based on the directed graphs
Abstract
This paper proposes a token based mutual exclusion algorithm for distributed systems that allows K simultaneous entries to a critical section. In the algorithm, a logical directed graph is maintained in a connected network.This algorithm does not use sequence numbers, and the number of messages required to provide mutual exclusion, is between 0 and 2*(N-l) where N is the number of processes in the network.
Year
DOI
Venue
1993
10.1145/163640.163646
Operating Systems Review
Keywords
Field
DocType
logical directed graph,connected network,sequence number,mutual exclusion algorithm,k simultaneous entry,distributed algorithm,critical section,mutual exclusion,distributed system,directed graph
Suzuki-Kasami algorithm,Maekawa's algorithm,Computer science,Critical section,Algorithm,Directed graph,Distributed algorithm,Suurballe's algorithm,Mutual exclusion,Security token,Distributed computing
Journal
Volume
Issue
Citations 
27
4
7
PageRank 
References 
Authors
0.59
13
1
Name
Order
Citations
PageRank
Mohamed Naimi119616.15