论文信息 - A matrix-geometric solution for the multiserver nonpreemptive priority queueing model with mixed priorities

A matrix-geometric solution for the multiserver nonpreemptive priority queueing model with mixed priorities

This paper describes the analysis of multiserver queues with nonpreemptive mixed priorities. Such priority structures occur, for example, in initiator settings within the mainframe operating system MVS: job classes have to be assigned to initiators and their priorities may differ amongst the initiators. Results of the analysis provide insight in how average queue lengths in this priority system behave under different class loads. Bounds have to be defined in order to obtain a matrix-geometric solution and it is shown how this affects the average queue lengths. The results should eventually allow to derive guidelines with respect to initiator definitions.

Herlinde Leemans | Guido Dedene

[1] Sidney L. Hantler,et al. On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes , 1992, Math. Oper. Res..

[2] B. A. Taylor,et al. Analysis of a non-preemptive priority multiserver queue , 1988, Advances in Applied Probability.

[3] Peter J. B. King,et al. Multiprocessor systems with preemptive priorities , 1981, Perform. Evaluation.

[4] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[5] Edward P. C. Kao,et al. Modelling a multiprocessor system with preemptive priorities , 1991 .

[6] Vaidyanathan Ramaswami,et al. A logarithmic reduction algorithm for quasi-birth-death processes , 1993, Journal of Applied Probability.

[7] Donald F. Towsley,et al. Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach , 1995, IEEE Trans. Computers.