.png){kind=icon}
.png){kind=icon}
Return
Mutual inclusion in asynchronous message-passing distributed systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2015.01.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the mutual inclusion problem, at least one process is in the critical section. However, only a solution for two processes with semaphores has been reported previously. In this study, a generalized problem setting is formalized and two distributed solutions are proposed based on an asynchronous message-passing model. In the local problem setting (the local mutual inclusion problem), for each process P, at least one of P and its neighbors must be in the critical section. For the local problem setting, a solution is proposed with O(Delta) message complexity, where Delta is the maximum degree (number of neighboring processes) of a network. In a global setting (the global mutual inclusion problem), at least one of the processes must be in the critical section. For the global problem setting, a solution is proposed with O(vertical bar Q vertical bar) message complexity, where vertical bar Q vertical bar is the maximum size for the quorum of a coterie used by the algorithm, which is typically vertical bar Q vertical bar = root n, where n is the number of processes in a network. 2015 Elsevier Inc. (C) All rights reserved.
Keywords:
Distributed algorithm
Mutual exclusion mutual inclusion
Process synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available