Parallel Fair Round Robin Scheduling in WDM Packet Switching Networks
暂无分享,去创建一个
[1] Jean-Yves Le Boudec,et al. Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.
[2] Sanjoy K. Baruah,et al. Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.
[3] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.
[4] Sanjoy K. Baruah,et al. Parallel switching in connection-oriented networks , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).
[5] James H. Anderson,et al. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.
[6] Sanjoy K. Baruah,et al. Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.
[7] Sanjoy K. Baruah,et al. Fairness in periodic real-time scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.
[8] Deming Liu,et al. An efficient scheduling discipline for packet switching networks using earliest deadline first round robin* , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).
[9] George N. Rouskas,et al. Deterministic Preemtive Scheduling of Real-Time Tasks , 2002, Computer.
[10] Jean-Yves Le Boudec,et al. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .