Guaranteeing Fair Service to Persistent Dependent Tasks
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (4) , 1168-1189
- https://doi.org/10.1137/s0097539795282092
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Proportionate Progress: A Notion of Fairness in Resource AllocationAlgorithmica, 1996
- MetaRing-a full-duplex ring with fairness and spatial reuseIEEE Transactions on Communications, 1993
- A local fairness algorithm for gigabit LAN's/MAN's with spatial reuseIEEE Journal on Selected Areas in Communications, 1993
- A polynomial time approximation algorithm for dynamic storage allocationDiscrete Mathematics, 1991
- Cellular packet communicationsIEEE Transactions on Communications, 1990
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Hierarchical ordering of sequential processesActa Informatica, 1971