International Journal of Networking and Computing
Online ISSN : 2185-2847
Print ISSN : 2185-2839
ISSN-L : 2185-2839
Special Issue on the Sixth International Symposium on Computing and Networking
Asynchronous message-passing distributed algorithm for the global critical section problem
Sayaka KameiHirotsugu Kakugawa
Author information
JOURNALS OPEN ACCESS

2019 Volume 9 Issue 2 Pages 147-160

Details
Abstract

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(√n), where n is the size of the network.

Information related to the author
© 2019 International Journal of Networking and Computing
Previous article Next article
feedback
Top