Fault-containing self-stabilization using priority scheduling

DOI10.1016/S0020-0190(00)00006-5MaRDI QIDQ1607036zbMATH OpenWikidataFDO

Authors Sukumar Ghosh, Xin He

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(00)00006-5

zbMATH Keywords

distributed algorithmsschedulers

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Fault-containing self-stabilizing distributed protocols
• Scalable self-stabilization
• A self-stabilizing algorithm for strong fairness
• Introduction to Distributed Self-Stabilizing Algorithms
• Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols

Cites work

• A self-stabilizing algorithm for constructing spanning trees
• An exercise in fault-containment: Self-stabilizing leader election
• Fault-containing self-stabilizing algorithms
• Fault-local distributed mending (extended abstract)
• Stabilizing phase-clocks
• Superstabilizing mutual exclusion
• Time-adaptive self stabilization

Cited in

(5)

• Stabilizing maximum matching in bipartite networks
• Fault-containing self-stabilization in asynchronous systems with constant fault-gap
• Monotonic self-stabilization and its application to robust and adaptive pattern formation
• An optimal self-stabilizing strarvation-free alternator
• Timer-based composition of fault-containing self-stabilizing protocols

This page was built for publication: Fault-containing self-stabilization using priority scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607036)