OPT versus LOAD in dynamic storage allocation

DOI10.1145/780542.780624MaRDI QIDQ3581277zbMATH OpenOpenAlexFDO

Authors Nick Reingold, Mikkel Thorup, Adam L. Buchsbaum, Howard Karloff, Claire Kenyon

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/780542.780624

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• OPTVersusLOADin Dynamic Storage Allocation
• On some packing problem related to dynamic storage allocation
• Approximation algorithms for dynamic storage allocation
• Dynamic, first-fit packings in two or more dimensions
• scientific article; zbMATH DE number 1003306

Cited in

(6)

• OPTVersusLOADin Dynamic Storage Allocation
• scientific article; zbMATH DE number 1926660 (Why is no real title available?)
• Approximation algorithms for round-UFP and round-SAP
• Single and multiple device DSA problems, complexities and online algorithms
• Choosing an optimum version of main-memory allocation
• Choice-memory tradeoff in allocations

This page was built for publication: OPT versus LOAD in dynamic storage allocation

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