A self-stabilizing algorithm for strong fairness

DOI10.1007/BF02684333zbMATH Open0897.68053OpenAlexW2013723883MaRDI QIDQ1387705FDOQ1387705

Authors: Mehmet Hakan Karaata, Pranay Chaudhuri 

Publication date: 5 October 1998

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684333

Recommendations

• A Distributed Maximal Scheduler for Strong Fairness
• Self-stabilization with path algebra
• Fault-containing self-stabilizing distributed protocols
• scientific article; zbMATH DE number 2036570
• Self-stabilization with \(r\)-operators

zbMATH Keywords

distributed systemsself-stabilization

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Cites Work

• Self-stabilizing systems in spite of distributed control
• Appraising fairness in languages for distributed programming
• Title not available (Why is that?)
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for constructing spanning trees
• The mutual exclusion problem
• An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives
• Self-stabilizing depth-first token circulation on networks
• A self-stabilizing algorithm for strong fairness

Cited In (6)

• A self-stabilizing algorithm for strong fairness
• Title not available (Why is that?)
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Fault-containing self-stabilization using priority scheduling
• Title not available (Why is that?)
• A Distributed Maximal Scheduler for Strong Fairness

This page was built for publication: A self-stabilizing algorithm for strong fairness

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