Probability Models for Multiprogramming Computer Systems
Journal of the ACM (JACM)
A Time-Sharing Queue with a Finite Number of Customers
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
Models of Pure time-sharing disciplines for resource allocation
ACM '69 Proceedings of the 1969 24th national conference
Analysis of system bottlenecks using a queueing network model
Proceedings of the SIGOPS workshop on System performance evaluation
Trace driven modeling and analysis of CPU scheduling in a multi-programming system
Proceedings of the SIGOPS workshop on System performance evaluation
Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Communications of the ACM
A simulation study of a demand-driven scheduling algorithm
ANSS '75 Proceedings of the 3rd symposium on Simulation of computer systems
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Approximate techniques for modeling the performance of complex systems
Computer Languages
| Hi-index | 0.02 |
The stationary distribution of the number of jobs being served by a processor-sharing central server is independent of both the distribution of service times and the distribution of interarrival times when those distributions have rational Laplace-Stieltjes transforms. This result holds for both finite source and infinite source models. The steady state is identical to the steady state when all distributions are exponential. The expected response time, queue size, and central processor idle time of the finite source model under processor-sharing and FCFS scheduling are compared. These measures of system performance are all larger under processor-sharing for a class of central processor service time distributions with a coefficient of variation less than one. The measures are all smaller under processor-sharing for a class of distributions with a coefficient of variation greater than one. Experiments with data collected from actual computer systems indicate that these results extend to more general models and have practical applications in existing computer systems.