Storage allocation under processor sharing. I: Exact solutions and asymptotics

DOI10.1007/s11134-010-9164-3zbMath1187.90103arXiv0907.3693MaRDI QIDQ972685

Charles Knessl, Eunju Sohn

Publication date: 21 May 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.3693

zbMATH Keywords

asymptotics; heavy traffic; processor sharing; storage allocation; joint probability distribution of occupied spaces; ranked server models

Mathematics Subject Classification ID

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage, Storage allocation under processor sharing II: Further asymptotic results

Cites Work

• Unnamed Item
• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• A provably efficient algorithm for dynamic storage allocation
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• Asymptotic expansions for a stochastic model of queue storage
• A simple direct solution to a storage allocation model
• Storage allocation under processor sharing II: Further asymptotic results
• Geometrical Optics and Models of Computer Memory Fragmentation
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes