Analysis of space allocation in a generally fragmented linear store

DOI10.1007/BF00290708MaRDI QIDQ1085973zbMATH OpenOpenAlexFDO

Authors Clement H. C. Leung

Publication date 1987

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00290708

zbMATH Keywords

performance analysisfile managementstorage fragmentation

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• 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

Cited in

(4)

• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• Space defragmentation for packing problems
• Analysis for the end of block wasted space
• A performance analysis of channel fragmentation in dynamic spectrum access systems

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)