### Feedback Queueing Models for Time-Shared SystemsFeedback Queueing Models for Time-Shared Systems

Access Restriction
Subscribed

 Author Coffman, Edward G. ♦ Kleinrock, Leonard Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1968 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Time-shared processing systems (e.g. communication or computer systems) are studied by considering priority disciplines operating in a stochastic queueing environment. Results are obtained for the average time spent in the system, conditioned on the length of required service (e.g. message lenght or number of computations). No chage is made for swap time, and the results hold only for Markov assumptions for the arrival and service processes.Two distinct feedback models with a single quantum-controlled service are considered. The first is a round-robin (RR) system in which the service facility processes each customer for a maximum of $\textit{q}$ sec. If the customer's service is completed during this quantum, he leaves the system; otherwise he returns to the end of the queue to await another quantum of service. The second is a feedback $(FB\textit{N})$ system with $\textit{N}$ queues in which a new arrival joins the tail of the first queue. The server gives service to a customer from the $\textit{n}th$ queue only if all lower numbered queues are empty. When taken from the $\textit{n}th$ queue, a customer is given $\textit{q}$ sec of service. If this completes his processing requirement he leaves the system; otherwise he joins the tail of the $(\textit{n}$ + 1)-st queue $(\textit{n}$ = 1, 2, · · ·, $\textit{N}$ - 1). The limiting case of $\textit{N}$ → ∞ is also treated. Both models are therefore quantum-controlled, and involve feedback to the tail of some queue, thus providing rapid service for customers with short service-time requirements. The interesting limiting case in which $\textit{q}$ → 0 (a “processor-shared” model) is also examined. Comparison is made with the first-come-first-served system and also the shortest-job-first discipline. Finally the FB∞ system is generalized to include (priority) inputs at each of the queues in the system. 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 1968-10-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 15 Issue Number 4 Page Count 28 Starting Page 549 Ending Page 576

#### Open content in new tab

Source: ACM Digital Library