Deadline fair scheduling: bridging the theory and practice of proportionate pair scheduling in multiprocessor systems
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Pfair scheduling of fixed and migrating periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Dynamic window-constrained scheduling for multimedia applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A firm real-time system implementation using commercial off-the-shelf hardware and free softwarePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Borrowed-virtual-time (BVT) schedulingPublished by Association for Computing Machinery (ACM) ,1999
- The Spring System: Integrated Support for Complex Real-Time SystemsPublished by Springer Nature ,1999
- A hierarchial CPU scheduler for multimedia operating systemsPublished by Association for Computing Machinery (ACM) ,1996
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- Service Burstiness and Dynamic Burstiness Measures: A FrameworkJournal of High Speed Networks, 1992
- The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1991
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989