Storage requirements for fair scheduling☆
References (3)
- et al.
Proof rules dealing with fairness
There are more references available in the full text version of this article.
Cited by (4)
Progress, justness, and fairness
2019, ACM Computing SurveysProgress, justness and fairness
2018, arXivFairness in Parallel Programs: The Transformational Approach
1988, ACM Transactions on Programming Languages and Systems (TOPLAS)Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
1986, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
This work was supported in part by the Office of Naval Research under Contract N00014-82-K-1054, and by the National Science Foundation under Grant MCS-8116678.
Copyright © 1983 Published by Elsevier B.V.