The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A distributed self-stabilizing solution to the dining philosophers problem
Information Processing Letters
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
The Stabilizing Philosopher: Asymmetry by Memory and by Action
The Stabilizing Philosopher: Asymmetry by Memory and by Action
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for coloring planar graphs
Distributed Computing - Special issue: Self-stabilization
A dining philosophers algorithm with polynomial response time
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Dynamic and self-stabilizing distributed matching
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Linear time self-stabilizing colorings
Information Processing Letters
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Alternators on uniform rings of odd size
Distributed Computing
Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Alternators in read/write atomicity
Information Processing Letters
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing algorithms for {k}-domination
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A uniform process alternator for arbitrary topologies
Journal of High Speed Networks
A new technique for proving self-stabilizing under the distributed scheduler
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Efficient transformation of distance-2 self-stabilizing algorithms
Journal of Parallel and Distributed Computing
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
A distributed algorithm for a b-coloring of a graph
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Information Processing Letters
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Hi-index | 0.00 |
Refining self-stabilizing algorithms which use tighter scheduling constraints (weaker daemon) into corresponding algorithms for weaker or no scheduling constraints (stronger daemon), while preserving the stabilization property, is useful and challenging. Designing transformation techniques for these refinements has been the subject of serious investigations in recent years. This paper proposes a transformation technique to achieve the above task. The heart of the transformer is a self-stabilizing local mutual exclusion algorithm. The local mutual exclusion problem is to grant a process the privilege to enter the critical section if and only if none of the neighbors of the process has the privilege. The contribution of this paper is twolold. First, we present a bounded-memory self-stabilizing local mutual exclusion algorithm for arbitrary network, assuming any arbitrary daemon. After stabilization, this algorithm maintains a bound on the service time (the delay between two successive executions of the critical section by a particular process). This bound is n脳(n-1)/2 where n is the network size. Second, we use the local mutual exclusion algorithm to design two scheduler transformers which convert the algorithms working under a weaker daemon to ones which work under the distributed, arbitrary (or unfair) daemon, both transformers preserving the self-stabilizing property. The first transformer refines algorithms written under the central daemon, while the second transformer refines algorithms designed for the k-fair (k 驴 (n - 1)) daemon.