Skip to main content
Article thumbnail
Location of Repository

Queue lengths and waiting times in the two-class two-server queue with nonpreemptive heterogeneous priority structures.

By Herlinde Leemans and Guido Dedene

Abstract

Our aim is to analyze a multiserver queue with nonpreemptive heterogeneous priority structures, which arises in the performance evaluation of batch initiator settings n MVS. We use matrix-geometric methods and derive the stationary distribution of queue lenghts and waitng times for the Markovian two-class two-server case.Structure; Performance; Performance evaluation; Evaluation; Methods; Distribution;

OAI identifier:

Suggested articles

Citations

  1. (1993). A logarithmic reduction algorithm for Quasi-Birth-Death processes.
  2. (1988). Analysis of a nonpreemptive priority multi server queue.
  3. (1998). Bounds for the mean queue lengths in a two-class two-server system with heterogeneous priority.
  4. (1991). Modeling a multiprocessor system with preemptive priorities.
  5. (1981). Multiprocessor systems with preemptive priorities. Performance Evaluation,
  6. (1992). On a preemptive Markovian queue with multiple servers and two priority classes.
  7. (1986). Parallel exponential queues with dependent service rates.
  8. (1985). Stationary waiting time distribution in queues with phase type service and in Quasi-Birth-andDeath processes.
  9. (1992). Steady-state algorithmic analysis of MIMic twopriority queues with heterogeneous servers.
  10. (1982). The solution of certain two-dimensional Markov models.
  11. (1998). The Two-Class Two-Server Queueing fl,fodel with Nonpreemptive Heterogeneous Priority Structures.
  12. (1979). Two coupled processors: the reduction to a Riemann-Hilbert problem.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.