Optimal rate-based scheduling on multiprocessors

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 189-198

  Srinivasan, Anand ^a   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; MULTITASKING; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING;

OPTIMAL RATE-BASED SCHEDULING; SCHEDULING ALGORITHM; SPORADIC TASK MODEL;

ALGORITHMS;

EID: 0036039360     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509935.509938     Document Type: Conference Paper

References (11)

1. Parallel switching in connection-oriented networks
2. Early-release fair scheduling
3. Pfair scheduling: Beyond periodic task systems
4. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
5. Proportionate progress: A notion of fairness in resource allocation
6. Fast scheduling of periodic tasks on multiple resources
7. Surplus fair scheduling: A proportional-share cpu scheduling algorithm for symmetric multiprocessors
8. Deadline fair scheduling: Bridging the theory and practice of proportionate-fair scheduling in multiprocessor servers
9. The rate-based execution model
10. Scheduling algorithms for multiprogramming in a hard-real-time environment
11. Fundamental design problems of distributed systems for the hard-real-time environment