Properties of delay-cost scheduling in time-sharing systems
暂无分享,去创建一个
[1] G. J. A. Stern,et al. Queueing Systems, Volume 2: Computer Applications , 1976 .
[2] Erol Gelenbe,et al. Analysis and Synthesis of Computer Systems , 1980 .
[3] Uttarayan Bagchi,et al. Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function , 1985, Oper. Res..
[4] Leonard Kleinrock,et al. Theory, Volume 1, Queueing Systems , 1975 .
[5] Leonard Kleinrock,et al. A delay dependent queue discipline , 1964 .
[6] Leonard Kleinrock,et al. Time Dependent Priority Queues , 1967, Oper. Res..
[7] Zvi Rosberg. Process Scheduling in a Computer System , 1985, IEEE Transactions on Computers.
[8] G. Klimov. Time-Sharing Service Systems. I , 1975 .
[9] R. Wolff. Time Sharing with Priorities , 1970 .
[10] John E. Gibson,et al. Nonlinear Automatic Control , 1963 .
[11] L. Kleinrock. A conservation law for a wide class of queueing disciplines , 1965 .
[12] Randolph D. Nelson. Heavy Traffic Response Times for a Priority Queue with Linear Priorities , 1990, Oper. Res..
[13] I. Adiri,et al. A Dynamic Priority Queue with General Concave Priority Functions , 1979, Oper. Res..
[14] Martin Greenberger,et al. The Priority Problem and Computer Time Sharing , 1966 .
[15] Edward G. Coffman,et al. A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..