Proportionate Progress: A Notion of Fairness in Resource Allocation

Algorithmica (New York)

Volumn 15, Issue 6, 1996, Pages 600-625

  Baruah, S K ^a   Cohen, N K ^a   Plaxton, C G ^a   Varvel, D A ^a  

^a University of Texas at Austin   (United States)

Author keywords

Euclid's algorithm; Fairness; Network flow; Periodic scheduling; Resource allocation

Indexed keywords

EID: 0001326859     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940883     Document Type: Article

References (14)

1. S. K. Baruah, R. R. Howell, and L. E. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, 2:301-324, 1990.
2. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448-461, 1973.
3. X. Deng. Mathematical Programming: Complexity and Applications. Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, September 1989.
4. L. R. Ford, Jr., and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
6. D. S. Hirschberg and C. K. Wong. A polynomial-time algorithm for the knapsack problem with two variables. Journal of the Association for Computing Machinery, 23:147-154, 1976.
7. W. A. Horn. Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21:177-185, 1974.
8. R. Kannan. A polynomial algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery, 27:118-122, 1980.
9. H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983.
10. J. Y.-T. Leung. A new algorithm for scheduling periodic, real-time tasks. Algorithmica, 4:209-219, 1989.
11. C. L. Liu. Scheduling Algorithms for Multiprocessors in a Hard-Real-Time Environment. JPL Space Programs Summary 37-60, vol. II, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, pages 28-37, November, 1969.
12. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery, 20:46-61, 1973.
13. H. E. Scarf. Production sets with indivisibilities. Part I: Generalities. Econometrica, 49:1-32, 1981.
14. H. E. Scarf. Production sets with indivisibilities. Part II: The case of two activities. Econometrica, 49:395-423, 1981.