期刊名称：International Journal of Networking and Computing
印刷版ISSN：2185-2847
出版年度：2019
卷号：9
期号：2
页码：147-160
出版社：International Journal of Networking and Computing
摘要：This paper considers the global ( l , k )-critical section problem which is the problem of controlling a system in such a way that at least l and at most k processes must be in the critical section at any time in the network, while each process alternates between in the critical section and out of the critical section. In this paper, first, a distributed solution for l -mutual inclusion is proposed in the asynchronous message-passing model. The proposed algorithm uses an ordinary quorum system and all processes play the same role, unlike existing algorithms for k -mutual exclusion. After that, using the proposed algorithm for $l$-mutual inclusion, we propose a distributed solution for the global ( l , k )-critical section problem. The proposed approach is a versatile composition of algorithms for l -mutual inclusion and k -mutual exclusion. Its message complexity is typically O (sqrt{ n} ), wheren is the size of the network.
关键词：Distributed algorithm; Mutual exclusion; Mutual inclusion; Process synchronization
