Frame based fair multiprocessor scheduler: a fast fair algorithm for real-time embedded systems
暂无分享,去创建一个
[1] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[2] James H. Anderson,et al. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2004, J. Comput. Syst. Sci..
[3] Jason Nieh,et al. Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler , 2001, USENIX Annual Technical Conference, General Track.
[4] Joseph Pasquale,et al. Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay , 2003, SIGCOMM '03.
[5] Jason Nieh,et al. Group Ratio Round-Robin: An O(1) Proportional Share Scheduler , 2003 .
[6] James H. Anderson,et al. Early-release fair scheduling , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.
[7] Sanjoy K. Baruah,et al. Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.
[8] Sanjoy K. Baruah,et al. The case for fair multiprocessor scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.
[9] Sanjoy K. Baruah,et al. Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.
[10] Steve Goddard,et al. A theory of rate-based execution , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).
[11] Sanjoy K. Baruah,et al. Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.