A Distributed Maximal Scheduler for Strong Fairness

DOI10.1007/978-3-540-75142-7_28MaRDI QIDQ3523220zbMATH OpenOpenAlexFDO

Authors Matthew Lang, Paolo A. G. Sivilotti

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_28

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Weak and strong fairness in CCS
• scientific article; zbMATH DE number 3878339
• A self-stabilizing algorithm for strong fairness
• On fairness notions in distributed systems. I: A characterization of implementability
• Keep it fair: equivalence and composition

Cited in

(4)

• A self-stabilizing algorithm for strong fairness
• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
• scientific article; zbMATH DE number 3878339 (Why is no real title available?)
• Rappel: exploiting interest and network locality to improve fairness in publish-subscribe systems

This page was built for publication: A Distributed Maximal Scheduler for Strong Fairness

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