Guaranteeing Pfair supertasks by reweighting

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2001, Pages 203-212

  Holman, Philip ^a   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

PFAIR SCHEDULING;

MULTIPROCESSING SYSTEMS;

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

References (8)

1. Efficient object sharing in quantum-based real-time systems
2. Early-release fair scheduling
3. Pfair scheduling: Beyond periodic task systems
4. Proportionate progress: A notion of fairness in resource allocation
5. Fast scheduling of periodic tasks on multiple resources
6. Pfair scheduling of generalized pinwheel task systems
7. Pfair scheduling of fixed and migrating periodic tasks on multiple resources