A Stochastic Model of Fragmentation in Dynamic Storage Allocation

DOI10.1137/0214032MaRDI QIDQ3742707zbMATH OpenOpenAlexFDO

Authors T. T. Kadota, Larry Shepp, E. G. jun. Coffman

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://repository.upenn.edu/statistics_papers/408

zbMATH Keywords

interacting particlesfragmentationmemory allocationPoisson streamcontainerizationcheckerboardingM/M/\(\infty \) queuepaged computer systems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Stochastic Models of Queue Storage
• A provably efficient algorithm for dynamic storage allocation
• Storage allocation under processor sharing. II: Further asymptotic results
• Analysis of space allocation in a generally fragmented linear store
• scientific article; zbMATH DE number 4046862

Cited in

(28)

• Storage allocation under processor sharing. I: Exact solutions and asymptotics
• Stochastic Models of Queue Storage
• scientific article; zbMATH DE number 4046862 (Why is no real title available?)
• Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
• Some exact and asymptotic solutions to single server models of dynamic storage
• Storage allocation under processor sharing. II: Further asymptotic results
• Stochastic service systems, random interval graphs and search algorithms
• Asymptotic expansions for a stochastic model of queue storage
• Delay-minimizing capacity allocation in an infinite server-queueing system
• Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions
• Closest open location rule under stochastic demand
• A provably efficient algorithm for dynamic storage allocation
• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• A simple direct solution to a storage allocation model
• A mean field model for a class of garbage collection algorithms in flash-based solid state drives
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Transient Analysis for State-Dependent Queues with Catastrophes
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• Saturation in a Markovian parking process
• Queue lengths in the \(GI^ X/M^ R/\infty\) service system
• Chainmail: A Model of First-fit Memory Allocation
• Sunset over Brownistan
• On a storage allocation model with finite capacity
• An infinite server system with packing constraints and ranked servers
• A performance analysis of channel fragmentation in dynamic spectrum access systems
• The \(GR^{X_ n}/G_ n/\infty\) system: System size
• A dynamic storage process
• Analysis of space allocation in a generally fragmented linear store

This page was built for publication: A Stochastic Model of Fragmentation in Dynamic Storage Allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742707)