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

DOI10.1145/321556.321569zbMath0197.15401OpenAlexW1980354292MaRDI QIDQ5594223

Philip J. Rasch

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321556.321569

zbMATH Keywords

computer science and automata

Related Items (3)

A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ Analysis of a multi-level time-sharing model ⋮ Queueing theory

This page was built for publication: A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems