Stable strategies for processor sharing systems
From MaRDI portal
Publication:802859
DOI10.1016/0377-2217(91)90340-2zbMATH Open0726.68011OpenAlexW2072852838MaRDI QIDQ802859FDOQ802859
Authors: Moshe Haviv
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90340-2
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
- scientific article; zbMATH DE number 1902275
- 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
- scientific article; zbMATH DE number 7042402
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (9)
- Processor sharing: a survey of the mathematical theory
- Stochastic approximation and user adaptation in a competitive resource sharing system
- Zero-sum Markov games and worst-case optimal control of queueing systems
- Non zero-sum stochastic games in admission, service and routing control in queueing systems
- Capacity competition of make-to-order firms
- Dynamic service sharing with heterogeneous preferences
- Individual equilibrium and learning in processor sharing systems
- Poly-symmetry in processor-sharing systems
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
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)