Busy Period Analysis of a Time-Sharing System

DOI10.1145/321707.321716zbMath0248.68024OpenAlexW2033461675MaRDI QIDQ5661145

Richard E. Nance, U. Narayan Bhat, Billy G. Claybrook

Publication date: 1972

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

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

zbMATH Keywords

busy period distributionLaplace-Stieltjes transformstime-sharing systemcentral processing unitperipheral units

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

A new formula for the busy period of a non-empty multiserver queueing system ⋮ The Fourier-series method for inverting transforms of probability distributions ⋮ Solving probability transform functional equations for numerical inversion ⋮ The busy period of an \(\mathrm{M}/\mathrm{M}/1\) queue with balking and reneging ⋮ Approximation techniques in the solution of queueing problems

This page was built for publication: Busy Period Analysis of a Time-Sharing System