Abstract
This paper deals with a single server serving
N
priority classes (
N
being finite or infinite) and working under an FB
z
regime, namely, one in which the waiting line consists of infinitely many separate queues obeying the FIFO rule. Each priority class is assigned to one of the queues. A customer from the
k
th priority class (“
k
-customer”) in the
n
th queue is eligible for
θ
n,k
time units of service, at the end of which he either departs, because his requirement is satisfied, or joins the tail of the (
n
+ 1)-th queue. When a quantum of service is completed, the server turns to the first customer in the lowest index (highest priority) nonempty queue.
The arrival process of
k
-customers is assumed to be homogeneous Poisson, and their service requirements are independent, generally distributed, random variable. A set of recursive linear equations is derived for the expected flow time of a
k
-customer whose service requirement is known, and some examples are discussed and presented graphically.
This paper corrects some errors in an earlier paper by the second author.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference5 articles.
1. A Dynamic Time-Sharing Priority Queue
2. Feedback Queueing Models for Time-Shared Systems
3. CoNwAY R.W. MAXWELL W.L. AND MILLER L.W Theory of Scheduhng Addison-Wesley Reading Mass. 1967 CoNwAY R.W. MAXWELL W.L. AND MILLER L.W Theory of Scheduhng Addison-Wesley Reading Mass. 1967
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献