An off-line storage allocation algorithm

DOI10.1016/0020-0190(87)90096-2MaRDI QIDQ1107966zbMATH OpenOpenAlexFDO

Authors Maciej Ślusarek

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90096-2

zbMATH Keywords

approximation strategycombinatorial problemNP-hardoff- line dynamic storage allocationresource allocation

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A dynamic storage allocation problem
• A note on the dynamic storage allocation problem
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• On some packing problem related to dynamic storage allocation

Cited in

(2)

• On some packing problem related to dynamic storage allocation
• Preorders, Partial Semigroups, and Quantales

This page was built for publication: An off-line storage allocation algorithm

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