- 1 Bard, Yonathan. A simple approach system modeling. IBM Cambridge Scientific Center, April 1980.Google Scholar
- 2 Bard, Yonathan. A model of shared DASD and multipathing. Comm. ACM 23, 10 (Oct. 1980) 564-572. Google ScholarDigital Library
- 3 Chandy, K.M. and Neuse, D. Linearizer: A heuristic algorithm for queueing network models of computing systems Comm. A CM., 25, 2 (Feb. 1982), 126-134. Google ScholarDigital Library
- 4 Chandy, K.M. and Saner, C.H. Approximate methods for analyzing queueing network models of computer systems. In G.S. Graham (Ed), "Queueing Network Models of Computer System Performance"; Computing Surveys 10, 3, (Sept. 1978) 281-317. Google ScholarDigital Library
- 5 Chandy, K.M., Herzog, U., and Woo, L. Parametric analysis of Queueing networks. IBM J. Res. Develop. 19, l, (Jan. 1975) 36-.--42.Google Scholar
- 6 Jacobson, Patricia A., and Lazowska, Edward D. The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems. Proc. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Las Vegas, September 1981. Google ScholarDigital Library
- 7 Saner, C.H. and MacNair, E.A. Simultaneous resource possession in queueing models of computers. Performance Evaluation Review 7, I & 2, (Spring-Summer 1978)41-52. Google ScholarDigital Library
- 8 Wilhelm, Neil C. A general model for the performance of disk systems. JACM 24, l, (Jan. 1977) 14-31. Google ScholarDigital Library
- 9 Zahorjan, J., Hume, J.N.P., and Sevcik, K.C. A queueing model of a rotational position sensing disk system, lnfor 16, 3, (Oct. 1978) 199-216.Google Scholar
Index Terms
- Analyzing queueing networks with simultaneous resource possession
Recommendations
Approximate solution of queueing networks with simultaneous resource possession
Queueing networks are important as Performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually ...
Analysis of Networks of the Resource Queuing Systems
Consideration was given to the model of a queuing network with resource queuing systems--the multi-server systems with losses where servicing of the accepted customer occupies random volumes of resources with the given distribution function depending on ...
Stability of size-based scheduling disciplines in resource-sharing networks
Performance 2005Size-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT) and Least Attained Service first (LAS) provide popular mechanisms for improving the overall delay performance by favoring smaller service requests over larger ones. ...
Comments