NDLI: Feedback Queueing Models for Time-Shared Systems

Content Provider	ACM Digital Library
Author	Coffman, Edward G. Kleinrock, Leonard
Copyright Year	1968
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.
Starting Page	549
Ending Page	576
Page Count	28
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/321479.321483
Journal	Journal of the ACM (JACM)
Volume Number	15
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1968-10-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System

Analysis of Two Time-Sharing Queueing Models

A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems

Synthesis of a Feedback Queueing Discipline for Computer Operation

On Optimal Scheduling Algorithms for Time-Shared Systems

Time-shared Systems: a theoretical treatment

Queueing Models for Computer Systems Connected by a Communication Line

A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service Time

Exact Aggregation in Exponential Queueing Networks

Feedback Queueing Models for Time-Shared Systems

Similar Documents

Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System

Analysis of Two Time-Sharing Queueing Models

A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems

Synthesis of a Feedback Queueing Discipline for Computer Operation

On Optimal Scheduling Algorithms for Time-Shared Systems

Time-shared Systems: a theoretical treatment

Queueing Models for Computer Systems Connected by a Communication Line

A Feedback Queueing System With Batch Arrivals, Bulk Service, and Queue-Dependent Service Time

Exact Aggregation in Exponential Queueing Networks

Feedback Queueing Models for Time-Shared Systems