Improved results for a memory allocation problem

DOI10.1007/S00224-009-9226-2MaRDI QIDQ2429723zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee

Publication date 1 April 2011

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00224-009-9226-2

zbMATH Keywords

approximation algorithmsbin packingcardinality constraintssplittable items

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Recommendations

• Improved Results for a Memory Allocation Problem
• On Packing Splittable Items with Cardinality Constraints
• Approximation algorithms for dynamic storage allocation
• Bin packing with fragmentable items: presentation and approximations
• Algorithms for on-line bin-packing problems with cardinality constraints

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• AFPTAS results for common variants of bin packing: a new method for handling the small items
• Algorithms for on-line bin-packing problems with cardinality constraints
• An improved lower bound for on-line bin packing algorithms
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Approximation schemes for ordered vector packing problems
• Approximation schemes for packing with item fragmentation
• Cardinality constrained bin-packing problems
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• Fast algorithms for bin packing
• New Algorithms for Bin Packing
• Online Bin Packing with Cardinality Constraints
• Parallelism versus memory allocation in pipelined router forwarding engines

Cited in

(12)

• Scheduling with interjob communication on parallel processors
• Scheduling with interjob communication on parallel processors
• EPTAS for the dual of splittable bin packing with cardinality constraint
• Fast allocation and deallocation with an improved buddy system
• A mathematical model and a metaheuristic approach for a memory allocation problem
• Application of combinatorial methods in the design of memory allocation algorithms
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Bin packing and related problems: general arc-flow formulation with graph compression
• Scheduling shared continuous resources on many-cores
• Exactly solving packing problems with fragmentation
• Improved Results for a Memory Allocation Problem
• Bin packing problem with conflicts and item fragmentation

This page was built for publication: Improved results for a memory allocation problem

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