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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Francez, N., Katz, S.: Appraising fairness in distributed languages. In: POPL 1987. Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 189–198. ACM Press, New York (1987)
Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading, Massachusetts (1988)
Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971)
Joshi, R., Misra, J.: Maximally concurrent programs. Formal Aspects of Computing 12(2), 100–119 (2000)
Joshi, R., Misra, J.: Toward a theory of maximally concurrent programs. In: Proceedings of PODC 2000, pp. 319–328 (2000)
Joung, Y.-J.: On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation 166, 1–34 (2001)
Karaata, M.H.: Self-stabilizing strong fairness under weak fairness. IEEE Trans. Parallel Distrib. Syst. 12(4), 337–345 (2001)
Lamport, L.: Fairness and hyperfairness. Distrib. Comput. 13(4), 239–245 (2000)
Lang, M., Sivilotti, P.A.G.: A distributed maximal scheduler for strong fairness. Technical Report OSU-CISRC-7/07-TR61, The Ohio State University (July 2007)
Lang, M., Sivilotti, P.A.G.: The maximality of unhygienic dining philosophers. Technical Report OSU-CISRC-5/07-TR39, The Ohio State University (May 2007)
Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA (1989)
Misra, J.: A Discipline of Multiprogramming: Programming Theory for Distributed Applications. Springer, New York (2001)
Park, D.: Concurrency and automata on infinite sequences. In: Proceedings of the 5th GI-Conference on Theoretical Computer Science, London, UK, pp. 167–183. Springer, Heidelberg (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lang, M., Sivilotti, P.A.G. (2007). A Distributed Maximal Scheduler for Strong Fairness. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)