Finite-size scaling approach to dynamic storage allocation problem

DOI10.1016/S0378-4371(03)00509-0MaRDI QIDQ1407990zbMATH OpenOpenAlexFDO

Authors Hamed Seyed-allaei

Publication date 14 September 2003

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0378-4371(03)00509-0

zbMATH Keywords

algorithmsemployed memoryrunning speed

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Nonnumerical algorithms (68W05) Computer system organization (68M99)

Recommendations

• A provably efficient algorithm for dynamic storage allocation
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Algorithms for resolving conflicts in dynamic storage allocation
• Approximation algorithms for dynamic storage allocation
• scientific article; zbMATH DE number 1003306

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3316542 (Why is no real title available?)
• On hearing the shape of a drum

Cited in

(1)

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

This page was built for publication: Finite-size scaling approach to dynamic storage allocation problem

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