Multiple-resource periodic scheduling problem: How much fairness is necessary?

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2003, Pages 142-151

  Zhu, Dakai ^a   Mossé, Daniel ^a   Melhem, Rami ^a  

^a University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; OPTIMIZATION; RESOURCE ALLOCATION; THEOREM PROVING;

BOUNDARY FAIR; MULTIPLE-RESOURCE PERIODIC SCHEDULING PROBLEM; SCHEDULING ALGORITHM;

REAL TIME SYSTEMS;

EID: 0347655207     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. J. Anderson and A. Srinivasan. Early-release fair scheduling. In Proc. of the 12th Euromicro Conference on Real-Time Systems, Jun. 2000.
2. J. Anderson and A. Srinivasan. Pfair scheduling; Beyond periodic task systems. In Proc. of the 7th International Workshop on Real-Time Computing Systems and Applications, Dec. 2000.
3. J. Anderson and A. Srinivasan. Mixed pfair/erfair scheduling of asynchronous periodic tasks. In Proc. of the 13th Euromicro Conference on Real-Time Systems, Jun 2001.
4. S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15(6): 600-625, 1996.
5. S. K. Baruah, J. Gehrke and C. G. Plaxton, Fast scheduling of periodic tasks on multiple resources. In Proc. of The International Parallel Processing Symposium, Apr. 1995.
6. 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.
7. D. Burger and T.M. Austin. The simplescalar tool set, version 2.0. Technical Report 1342. Department of Computer Science, University of Wisconsin-Madison, Jun. 1997.
8. P. Holman and J. Anderson. Guaranteeing pfair supertasks by reweighting. In Proc. of the 22nd IEEE Real-Time Systems Symposium, Dec. 2001.
9. C.L. Liu. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, pages 28-37, Nov. 1969.
10. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6;1-12, 1959.
11. M. Moir and S. Ramamurthy, Pfair scheduling of fixed and migrating tasks on multiple resources. In Proc. of the 20th IEEE Real-Time Systems Symposium, Dec. 1999.