Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage

DOI10.1080/15326349.2012.672145zbMath1246.90013OpenAlexW1989686762MaRDI QIDQ2904312

Eunju Sohn, Charles Knessl

Publication date: 13 August 2012

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349.2012.672145

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Inventory, storage, reservoirs (90B05) Perturbations, asymptotics of solutions to ordinary differential equations (34E10)

Cites Work

• Unnamed Item
• 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
• 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
• Storage allocation under processor sharing II: Further asymptotic results
• Stochastic Models of Queue Storage
• 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

This page was built for publication: Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage