Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler

2004/03/01 by A. K. Datta, Anwitaman Datta · 1 citation
Computer Science · Business, Management and Accounting · #Distributed systems and fault tolerance #Advanced Queuing Theory Analysis #Optimization and Search Problems

paper · doi:10.1093/comjnl/47.3.289

Abstract

Journal Article Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler Get access Ajoy K. Datta, Ajoy K. Datta Search for other works by this author on: Oxford Academic Google Scholar Maria Gradinariu, Maria Gradinariu Search for other works by this author on: Oxford Academic Google Scholar Sébastien Tixeuil Sébastien Tixeuil Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 47, Issue 3, 2004, Pages 289–298, https://doi.org/10.1093/comjnl/47.3.289 Published: 01 January 2004

Cited by

• Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)

Related

• Errata for Three Papers (2004-05) on Fixed-Priority Scheduling with Self-Suspensions
• Introducing Speculation in Self-Stabilization - An Application to Mutual Exclusion
• Partial mutual exclusion for infinitely many processes
• Two Mutual Exclusion Algorithms for Shared Memory
• Nestedness in mutualistic networks emerges from a modified rule of preferential attachment