A provably efficient algorithm for dynamic storage allocation
From MaRDI portal
Publication:756873
DOI10.1016/0022-0000(89)90031-7zbMATH Open0723.60117OpenAlexW4230764056MaRDI QIDQ756873FDOQ756873
Recommendations
Cites work
- scientific article; zbMATH DE number 4046862 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3259552 (Why is no real title available?)
- scientific article; zbMATH DE number 3408613 (Why is no real title available?)
- scientific article; zbMATH DE number 3025566 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- Algorithms for resolving conflicts in dynamic storage allocation
- An Introduction to Combinatorial Models of Dynamic Storage Allocation
- Limiting diffusion approximations for the many server queue and the repairman problem
- On the external storage fragmentation produced by first-fit and best-fit allocation strategies
- Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
- The average-case analysis of some on-line algorithms for bin packing
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Weak convergence of compound stochastic process. I
Cited in
(32)- Stochastic on-line knapsack problems
- Fuzzy bin packing problem.
- Analysis of space allocation in a generally fragmented linear store
- Dynamic storage allocation with known durations
- scientific article; zbMATH DE number 1003306 (Why is no real title available?)
- Analysis for the end of block wasted space
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Space overhead bounds for dynamic memory management with partial compaction
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- Stochastic analysis of dynamic processes
- Optimal allocation of storage space
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- A performance analysis of channel fragmentation in dynamic spectrum access systems
- Cost-oblivious storage reallocation
- The distribution of wasted spaces in the M/M/∞ queue with ranked servers
- scientific article; zbMATH DE number 4046862 (Why is no real title available?)
- Asymptotic expansions for a stochastic model of queue storage
- Robust storage assignment in stack- and queue-based storage systems
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Storage allocation under processor sharing. I: Exact solutions and asymptotics
- Insertion and Compaction Algorithms in Sequentially Allocated Storage
- Some exact and asymptotic solutions to single server models of dynamic storage
- Storage allocation under processor sharing. II: Further asymptotic results
- Chainmail: A Model of First-fit Memory Allocation
- scientific article; zbMATH DE number 6399332 (Why is no real title available?)
- The online graph bandwidth problem
- Finite-size scaling approach to dynamic storage allocation problem
- Algorithms for resolving conflicts in dynamic storage allocation
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Optimality and greed in dynamic allocation
- Average-case analysis of cutting and packing in two dimensions
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)
