Skip to main content
Conference ProceedingsOPEN ACCESS

Fairness for dynamic control

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6015 LNCS 251-265
DOI: 10.1007/978-3-642-12002-2_20
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Already in Lamport's bakery algorithm, integers are used for fair schedulers of concurrent processes. In this paper, we present the extension of a fair scheduler from 'static control' (the number of processes is fixed) to 'dynamic control' (the number of processes changes during execution). We believe that our results shed new light on the concept of fairness in the setting of dynamic control. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Hoenicke, J., Olderog, E. R., & Podelski, A. (2010). Fairness for dynamic control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6015 LNCS, pp. 251–265). https://doi.org/10.1007/978-3-642-12002-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free