DQFS service: a tunable scheme to reduce scheduling overhead in integrated services networks
暂无分享,去创建一个
[1] Raj Vaswani,et al. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors , 1993, TOCS.
[2] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[3] Kumar Jayantilal Parekn Abhay,et al. A generalized processor sharing approach to frow control in integrated services networks , 1992 .
[4] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.
[5] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[6] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.
[7] QueueingJon,et al. WF 2 Q : Worst-case Fair Weighted Fair , 1996 .