Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon

Hirotsugu Kakugawa, Masafumi Yamashita

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (d-daemon). The system is stabilized with probability 1 in O(n3) expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized.

Original languageEnglish
Pages (from-to)885-898
Number of pages14
JournalJournal of Parallel and Distributed Computing
Volume62
Issue number5
DOIs
Publication statusPublished - Jan 1 2002

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon'. Together they form a unique fingerprint.

  • Cite this