Stable strategies for processor sharing systems
From MaRDI portal
Recommendations
- Stability of Processor Sharing Networks with Simultaneous Resource Requirements
- An Optimal Design Problem for Limited Processor Sharing Systems
- Processor sharing: a survey of the mathematical theory
- Publication:4804535
- Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors
- On processor sharing and random service
- A strategic timing of arrivals to a linear slowdown processor sharing system
- Publication:4630375
Cites work
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3948142 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- ?/M/1: On the equilibrium distribution of customer arrivals
- Reneging from Processor Sharing Systems and Random Queues
- Stable priority purchasing in queues
Cited in
(9)- Poly-symmetry in processor-sharing systems
- Processor sharing: a survey of the mathematical theory
- Non zero-sum stochastic games in admission, service and routing control in queueing systems
- Capacity competition of make-to-order firms
- Stochastic approximation and user adaptation in a competitive resource sharing system
- Dynamic service sharing with heterogeneous preferences
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
- Individual equilibrium and learning in processor sharing systems
- Zero-sum Markov games and worst-case optimal control of queueing systems
This page was built for publication: Stable strategies for processor sharing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802859)
