An Analysis of the M / G /1 Queue Under Round-Robin Scheduling

M. Sakata, S. Noguchi and J. Oizumi
Additional contact information
M. Sakata: Tohoku University, Sendai, Japan
S. Noguchi: Tohoku University, Sendai, Japan
J. Oizumi: Tohoku University, Sendai, Japan

Operations Research, 1971, vol. 19, issue 2, 371-385

Abstract: In order to discuss scheduling algorithms for time-sharing computer systems, this paper analyzes the M / G /1 queue under the well known round-robin (RR) discipline. Three models are considered: the constant-quantum RR model, the processor-shared (or zero-quantum RR) model, and the variable-quantum RR model. The paper proposes an effective calculating method for obtaining the expected response time under an arbitrary processing-time distribution with overhead. By the theoretical analysis, one can show how the response time is affected by the scheduling and processing-time distributions, as is demonstrated by some typical examples.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.2.371 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:2:p:371-385

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().