Analysis of space allocation in a generally fragmented linear store
The space allocation process in a fragmented linear store with general fragmentation characteristics is analysed. For a given allocation requirement t, exact expression for the n-th moment of the allocation penalty for single block contiguous allocation is obtained, which for large t is shown to be \(O(\bar F(t)^{-n})\), where \(\bar F(\cdot)\) is the complementary distribution function of the free block sizes. For multiple block non-contiguous allocation, it is shown that the corresponding penalty can be approximated by an n-th degree polynomial and is \(O(t^ n)\) for large t. Compared with experimental values, the model results are able to achieve good agreement.
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- Approximation algorithms for dynamic storage allocation
- Dynamic storage allocation with limited compaction - complexity and some practical implications
- scientific article; zbMATH DE number 176171
- A provably efficient algorithm for dynamic storage allocation
- A polynomial time approximation algorithm for dynamic storage allocation
- Tight Bounds for Dynamic Storage Allocation
- scientific article; zbMATH DE number 1003306
- A simple direct solution to a storage allocation model
- A constant factor approximation algorithm for the storage allocation problem
This page was built for publication: Analysis of space allocation in a generally fragmented linear store
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085973)
