Self-stabilizing l-exclusion

Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

Our work presents a self-stabilizing solution to the l-exclusion problem. This problem is a well-known generalization of the mutual-exclusion problem in which up to l, but never more than l, processes are allowed simultaneously in their critical sections. Self-stabilization means that even when transient failures occur and some processes crash, the system finally resumes its regular and correct behavior. The model of communication assumed here is that of shared memory, in which processes use single-writer multiple-reader regular registers.

Original languageEnglish
Pages (from-to)653-692
Number of pages40
JournalTheoretical Computer Science
Volume266
Issue number1-2
DOIs
StatePublished - 6 Sep 2001

Keywords

  • Communication registers
  • Mutual exclusion
  • Resource allocation
  • Self-stabilization

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Self-stabilizing l-exclusion'. Together they form a unique fingerprint.

Cite this