Time Sharing with Priorities

DOI10.1137/0119057MaRDI QIDQ5606448zbMATH OpenOpenAlexFDO

Authors Ronald 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

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

Cited in

(7)

• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• 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
• Optimal scheduling policies in time sharing service systems
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
• Processor sharing: a survey of the mathematical theory

This page was built for publication: Time Sharing with Priorities

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