arXiv Open Access 2018

An asynchronous message-passing distributed algorithm for the global critical section problem

Sayaka Kamei Hirotsugu Kakugawa

Lihat Sumber

Abstrak

This paper considers the global $(l,k)$-CS problem which is the problem of controlling the system in such a way that, at least $l$ and at most $k$ processes must be in the CS at a time in the network. In this paper, a distributed solution is proposed in the asynchronous message-passing model. Our solution is a versatile composition method of algorithms for $l$-mutual inclusion and $k$-mutual exclusion. Its message complexity is $O(|Q|)$, where $|Q|$ is the maximum size for the quorum of a coterie used by the algorithm, which is typically $|Q| = \sqrt{n}$.

Topik & Kata Kunci

cs.DC

Penulis (2)

Sayaka Kamei

Hirotsugu Kakugawa

Format Sitasi

APA MLA BibTeX

Kamei, S., Kakugawa, H. (2018). An asynchronous message-passing distributed algorithm for the global critical section problem. https://arxiv.org/abs/1807.05674

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓