A Theory of Bounded Fair Scheduling

Authors:
Jens Schönborn;Marcel Kyas
Affiliations:
Christian-Albrechts-Universität zu Kiel, Germany;Department of Informatics, University of Oslo, Norway
Venue:
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Year:
2008

Citing 8
Cited 1

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Finitary fairness

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof Rules Dealing with Fairness

Logic of Programs, Workshop
Proving Fairness of Schedulers

Proceedings of the Conference on Logic of Programs
Polynomial Fairness and Liveness

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Creol: a type-safe object-oriented model for distributed concurrent systems

Theoretical Computer Science - Components and objects
Testing Concurrent Objects with Application-Specific Schedulers

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing

Testing Concurrent Objects with Application-Specific Schedulers

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modeling languages like UML use asynchronous communication but do not specify the order in which messages are received. A simple language for specifying such orders declaratively is proposed that ensures fair and bounded fair scheduling. Such scheduling specifications are then translated to Streett automata that accept only and all infinite runs satisfying the specification. Using the automaton as a scheduler guarantees fairness and allows to analyze schedulability using standard automata-theoretic algorithms. The formalism is extended to the case of an uncooperative environment by "fall-back" scheduling specifications when events required for progress are not provided by the environment.