Storage allocation under processor sharing II: Further asymptotic results

DOI10.1017/S0956792510000306zbMath1207.90042arXiv0907.3683MaRDI QIDQ3081338

Eunju Sohn, Charles Knessl

Publication date: 7 March 2011

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

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

Related Items

Storage allocation under processor sharing. I: Exact solutions and asymptotics, Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage

Cites Work

• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• A provably efficient algorithm for dynamic storage allocation
• Storage allocation under processor sharing. I: Exact solutions and asymptotics
• 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
• Geometrical Optics and Models of Computer Memory Fragmentation
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system