A provably efficient algorithm for dynamic storage allocation
DOI10.1016/0022-0000(89)90031-7zbMATH Open0723.60117OpenAlexW4230764056MaRDI QIDQ756873FDOQ756873
Authors: E. G. jun. Coffman, F. Thomson Leighton 
Publication date: 1989
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(89)90031-7
Recommendations
Poisson processbin-packingexperimental datadesign and analysis of algorithms for on-line dynamic storage allocationplanar matching
Analysis of algorithms and problem complexity (68Q25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Limiting diffusion approximations for the many server queue and the repairman problem
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Title not available (Why is that?)
- Weak convergence of compound stochastic process. I
- Title not available (Why is that?)
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- The average-case analysis of some on-line algorithms for bin packing
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
- Algorithms for resolving conflicts in dynamic storage allocation
- On the external storage fragmentation produced by first-fit and best-fit allocation strategies
- Title not available (Why is that?)
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
Cited In (32)
- Storage allocation under processor sharing. I: Exact solutions and asymptotics
- Finite-size scaling approach to dynamic storage allocation problem
- Algorithms for resolving conflicts in dynamic storage allocation
- Fuzzy bin packing problem.
- Title not available (Why is that?)
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Some exact and asymptotic solutions to single server models of dynamic storage
- Storage allocation under processor sharing. II: Further asymptotic results
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- Cost-oblivious storage reallocation
- Asymptotic expansions for a stochastic model of queue storage
- Robust storage assignment in stack- and queue-based storage systems
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- The online graph bandwidth problem
- Average-case analysis of cutting and packing in two dimensions
- Stochastic on-line knapsack problems
- Space overhead bounds for dynamic memory management with partial compaction
- Insertion and Compaction Algorithms in Sequentially Allocated Storage
- Title not available (Why is that?)
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Dynamic storage allocation with known durations
- Optimality and greed in dynamic allocation
- The distribution of wasted spaces in the M/M/∞ queue with ranked servers
- Optimal allocation of storage space
- Analysis for the end of block wasted space
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Chainmail: A Model of First-fit Memory Allocation
- Stochastic analysis of dynamic processes
- Title not available (Why is that?)
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- A performance analysis of channel fragmentation in dynamic spectrum access systems
- Analysis of space allocation in a generally fragmented linear store
This page was built for publication: A provably efficient algorithm for dynamic storage allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756873)
