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

DOI10.1145/321556.321569MaRDI QIDQ5594223zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5594223)