Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Anderson, H.A., Jr. (1973). Approximating Pre-emptive Priority Dispatching in a Multiprogramming Model. IBM J. Res. Develop, Vol.17, No.6, November 1973, pp. 533–539.
2. Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G. (1975). Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. J. ACM, Vol.22, No.2, April 1975, pp. 248–260.
3. Boyse, J.H., and Warn, D.R. (1975). A Straightforward Model for Computer Performance Prediction. ACM Computing Surveys, Vol.7, no.2, April 1975, pp. 73–93.
4. Kameda, H. (1979). A Finite-Source Queue with Different Customers. Technical Report 79-01, Dept. of Computer Science, The University of Electro-Communications, October 1979. To appear in J. ACM, Vol.29, No.2, April 1982.
5. Lazowska, E.D., and Sevcik, K.C. (1974). Scheduling in Systems with Two Scarce Resources. Proc. ACM Nat'l Conf. San Diego (Calif.), November 1974, pp. 66–73.