.png){kind=icon}
Return
An efficient distributed token-based mutual exculsion algorithm with central coordinator
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.2002.1847.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new distributed mutual exclusion algorithm is proposed in this paper. This algorithm is a centralized token-based algorithm. An improvement of the synchronization delay for centralized mutual exclusion in distributed systems is achieved by modifying the standard algorithm for centralized mutual exclusion by a forwarding mechanism that allows tokens to be passed directly between requesters instead of always going through a centralized coordinator. Performance metrics such as synchronization delay, messages per request, and response time under light and heavy loads, are presented. Analysis shows that this algorithm outperforms existing algorithms and its performance is close to the lower bounds of these metrics. (C) 2002 Elsevier Science (USA).
Keywords:
distributed mutual exclusion algorithm
token-based
centralized
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more