Experimental Studies of Granularity Aware ( m , k ) Scheduling for Real-time Media Servers
暂无分享,去创建一个
[1] Azer Bestavros,et al. Statistical rate monotonic scheduling , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).
[2] Parameswaran Ramanathan,et al. Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines , 1997, IEEE Trans. Computers.
[3] Yuting Zhang,et al. A virtual deadline scheduler for window-constrained service guarantees , 2004, 25th IEEE International Real-Time Systems Symposium.
[4] R. Guérin,et al. Supporting Excess Real-Time Traffic With Active Drop Queue , 2006, IEEE/ACM Transactions on Networking.
[5] Domenico Ferrari,et al. Client requirements for real-time communication services , 1990, IEEE Communications Magazine.
[6] Henning Schulzrinne,et al. Real-time communication in packet-switched networks , 1994, Proc. IEEE.
[7] Christian Poellabauer,et al. Dynamic window-constrained scheduling of real-time streams in media servers , 2004, IEEE Transactions on Computers.
[8] Aaron Striegel,et al. Dynamic class-based queue management for scalable media servers , 2003, J. Syst. Softw..
[9] QueueingJon,et al. WF 2 Q : Worst-case Fair Weighted Fair , 1996 .
[10] Calton Pu,et al. Rate-matching packet scheduler for real-rate applications , 2000, IS&T/SPIE Electronic Imaging.
[11] Aaron Striegel,et al. Best-effort scheduling of (m, k)-firm real-time streams in multihop networks , 2000, Comput. Commun..
[12] Mor Harchol-Balter,et al. Implementation of SRPT Scheduling in Web Servers , 2000 .
[13] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.