Fault-containing self-stabilization using priority scheduling
From MaRDI portal
Publication:1607036
DOI10.1016/S0020-0190(00)00006-5zbMath1014.68013WikidataQ127436305 ScholiaQ127436305MaRDI QIDQ1607036
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Fault-containing self-stabilization in asynchronous systems with constant fault-gap ⋮ Timer-based composition of fault-containing self-stabilizing protocols ⋮ Stabilizing maximum matching in bipartite networks ⋮ Monotonic self-stabilization and its application to robust and adaptive pattern formation ⋮ An optimal self-stabilizing strarvation-free alternator
Cites Work
- An exercise in fault-containment: Self-stabilizing leader election
- Stabilizing phase-clocks
- A self-stabilizing algorithm for constructing spanning trees
- Fault-containing self-stabilizing algorithms
- Superstabilizing mutual exclusion
- Fault-local distributed mending (extended abstract)
- Time-adaptive self stabilization
This page was built for publication: Fault-containing self-stabilization using priority scheduling
