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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lang, M., & Sivilotti, P. A. G. (2007). A distributed maximal scheduler for strong fairness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4731 LNCS, pp. 358–372). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_28
Mendeley helps you to discover research relevant for your work.