Multilevel Queues with Extremal PrioritiesMultilevel Queues with Extremal Priorities

Access Restriction
Subscribed

 Author Rosberg, Z. ♦ Adiri, I. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1976 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract This paper deals with a single server serving $\textit{N}$ priority classes $(\textit{N}$ being finite or infinite) and working under an FBz 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 $\textit{k}th$ priority class $(“\textit{k}-customer”)$ in the $\textit{n}th$ queue is eligible for $\textit{&thgr;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 $(\textit{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 $\textit{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 $\textit{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. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1976-10-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 23 Issue Number 4 Page Count 11 Starting Page 680 Ending Page 690

Open content in new tab

Source: ACM Digital Library