Approximation algorithms for dynamic storage allocation

DOI10.1007/3-540-61680-2_46MaRDI QIDQ4595477zbMATH OpenOpenAlexFDO

Authors Jordan Gergov

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_46

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Theory of operating systems (68N25)

Recommendations

• Computing and Combinatorics
• A polynomial time approximation algorithm for dynamic storage allocation
• scientific article; zbMATH DE number 1003306
• scientific article; zbMATH DE number 6399332
• Tight Bounds for Dynamic Storage Allocation

Cited in

(35)

• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
• Improved results for a memory allocation problem
• scientific article; zbMATH DE number 1926660 (Why is no real title available?)
• Finite-size scaling approach to dynamic storage allocation problem
• A polynomial time approximation algorithm for dynamic storage allocation
• OPT versus LOAD in dynamic storage allocation
• On spectrum assignment in elastic optical tree-networks
• On approximating the memory-constrained module allocation problem
• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• A (2+)-approximation algorithm for the storage allocation problem
• Robust storage assignment in stack- and queue-based storage systems
• Approximation bounds for the minimum k-storage problem
• Insertion and Compaction Algorithms in Sequentially Allocated Storage
• scientific article; zbMATH DE number 1003306 (Why is no real title available?)
• Breaking the barrier of 2 for the storage allocation problem
• scientific article; zbMATH DE number 4043214 (Why is no real title available?)
• Dynamic storage allocation with limited compaction - complexity and some practical implications
• Single and multiple device DSA problems, complexities and online algorithms
• Dynamic storage allocation with known durations
• Three approximation algorithms for solving the generalized segregated storage problem.
• Optimizing bandwidth allocation in elastic optical networks with application to scheduling
• Optimal allocation of storage space
• An approximation result for a periodic allocation problem
• Computing and Combinatorics
• Fast primal-dual distributed algorithms for scheduling and matching problems
• Single and multiple device DSA problem, complexities and online algorithms
• scientific article; zbMATH DE number 3273532 (Why is no real title available?)
• scientific article; zbMATH DE number 6399332 (Why is no real title available?)
• OPTVersusLOADin Dynamic Storage Allocation
• Improved Results for a Memory Allocation Problem
• On the interval chromatic number of proper interval graphs
• An improved upper bound for the ring loading problem
• scientific article; zbMATH DE number 2080220 (Why is no real title available?)
• Analysis of space allocation in a generally fragmented linear store

This page was built for publication: Approximation algorithms for dynamic storage allocation

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