A distributed maximal scheduler for strong fairness

Authors:
Matthew Lang;Paolo A. G. Sivilotti
Affiliations:
Department of Computer Science and Engineering, The Ohio State University, Columbus OH;Department of Computer Science and Engineering, The Ohio State University, Columbus OH
Venue:
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Year:
2007

Citing 9
Cited 1

Appraising fairness in distributed languages

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel program design: a foundation

Parallel program design: a foundation
Toward a theory of maximally concurrent programs (shortened version)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
On fairness notions in distributed systems I.4: a characterization of implementability

Information and Computation
Self-Stabilizing Strong Fairness under Weak Fairness

IEEE Transactions on Parallel and Distributed Systems
A discipline of multiprogramming: programming theory for distributed applications

A discipline of multiprogramming: programming theory for distributed applications
Communication and Concurrency

Communication and Concurrency
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Fairness and hyperfairness

Distributed Computing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weak fairness guarantees that continuously enabled actions are executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are enabled infinitely often (but not necessarily continuously) are executed infinitely often. In this paper, we present a distributed algorithm for scheduling actions for execution. Assuming weak fairness for the execution of this algorithm, the schedule it provides is strongly fair. Furthermore, this algorithm is maximal in that it is capable of generating any strongly fair schedule. This algorithm is the first strongly-fair scheduling algorithm that is both distributed and maximal.