Time Sharing with Priorities

DOI10.1137/0119057zbMath0206.22401OpenAlexW2031381480MaRDI QIDQ5606448

Ronald W. Wolff

Publication date: 1970

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0119057

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Numerical linear algebra (65F99)

Related Items (7)

Optimal scheduling policies in time sharing service systems ⋮ A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions ⋮ Processor sharing: a survey of the mathematical theory ⋮ On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

This page was built for publication: Time Sharing with Priorities