Chainmail: A Model of First-fit Memory Allocation

DOI10.1093/COMJNL/30.3.201MaRDI QIDQ4723295zbMATH OpenOpenAlexFDO

Authors C. M. Reeves

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/30.3.201

zbMATH Keywords

block reservationdynamic storage allocationefficient use of resourcesMarkov chainmemory configuration

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 4046862
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• The exhaustion of shared memory: Stochastic results
• A provably efficient algorithm for dynamic storage allocation
• Efficient algorithms for dynamic allocation of distributed memory

Cited in

(1)

• scientific article; zbMATH DE number 4046862 (Why is no real title available?)

This page was built for publication: Chainmail: A Model of First-fit Memory Allocation

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