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

Philip John Rasch

34 citations0/0 files storedJournal of the ACM

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Real-Time Systems Scheduling Optimization and Search Problems

Abstract

The queue size distribution and average waiting time for a time-shared system using round-robin scheduling, with and without overhead, are derived.Priorities are assigned to incoming users based on a decreasing function of program length.Using this priority assignment, a cost analysis is made that shows the effects of changing the system parametets and determines the optimum quantum length.The input rate and the quantum length that will saturate the system are also determined.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 34 citations exist upstream.

References

1963Introduction to the Theory of Queues.1967Time-shared Systems 1967QUEUES AND INVENTORIES 1958Queues, Inventories, and Maintenance 1965AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS 1966The Priority Problem and Computer Time Sharing

Cited by

1981A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.