Improved results for a memory allocation problem
From MaRDI portal
Publication:2429723
DOI10.1007/s00224-009-9226-2zbMath1209.68006OpenAlexW2125259827MaRDI QIDQ2429723
Publication date: 1 April 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9226-2
Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Scheduling shared continuous resources on many-cores ⋮ Scheduling with interjob communication on parallel processors ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Bin packing and related problems: general arc-flow formulation with graph compression ⋮ Exactly solving packing problems with fragmentation ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ Scheduling with Interjob Communication on Parallel Processors ⋮ Bin packing problem with conflicts and item fragmentation
Cites Work
- Unnamed Item
- Parallelism versus memory allocation in pipelined router forwarding engines
- Approximation schemes for packing with item fragmentation
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- Algorithms for on-line bin-packing problems with cardinality constraints
- Cardinality constrained bin-packing problems
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- New Algorithms for Bin Packing
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Approximation schemes for ordered vector packing problems
- Online Bin Packing with Cardinality Constraints
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
This page was built for publication: Improved results for a memory allocation problem
