Dynamic sharing of a multiple access channel

Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n processes perform a concurrent program which occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to design a distributed algorithm to control entries and exits to/from the shared resource in such a way that in any time there is at most one process accessing it. We consider both the classic and a slightly weaker version of mutual exclusion, called ε-mutual-exclusion, where for each period of a process staying in the critical section the probability that there is some other process in the critical section is at most ε. We show that there are channel settings, where the classic mutual exclusion is not feasible even for randomized algorithms, while ε-mutual-exclusion is. In more relaxed channel settings, we prove an exponential gap between the makespan complexity of the classic mutual exclusion problem and its weaker ε-exclusion version. We also show how to guarantee fairness of mutual exclusion algorithms, i.e., that each process that wants to enter the critical section will eventually succeed.

Original languageEnglish (US)
Title of host publicationSTACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science
Pages83-94
Number of pages12
DOIs
StatePublished - Dec 1 2010
Externally publishedYes
Event27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 - Nancy, France
Duration: Mar 4 2010Mar 6 2010

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume5
ISSN (Print)1868-8969

Conference

Conference27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010
CountryFrance
CityNancy
Period3/4/103/6/10

    Fingerprint

Keywords

  • Distributed algorithms
  • Multiple access channel
  • Mutual exclusion

ASJC Scopus subject areas

  • Software

Cite this

Bienkowski, M., Klonowski, M., Korzeniowski, M., & Kowalski, D. R. (2010). Dynamic sharing of a multiple access channel. In STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science (pp. 83-94). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 5). https://doi.org/10.4230/LIPIcs.STACS.2010.2446