Add to ORKGIn this report, we look at the problem of packing a number of arrays in memory efficiently. This is known as the dynamic storage allocation problem (DSA) and it is known to be NP-complete. We develop some simple, polynomial-time approximation algorithms with the best of them achieving a bound of 4 for a sub-class of DSA instances. We report on an extensive experimental study on the FirstFit heuristic and show that the average-case performance on random instances is within 7% of the optimal value. Also cross-referenced as UMIACS-TR-99-3
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, e...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
We show that it is possible to store a dynamic ordered set S of n integers drawn from a bounded univ...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
AbstractWe study the single-device Dynamic Storage Allocation (DSA) problem and the multi-device Bal...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
Interval allocation has been suggested as a possible formalization for the PRAM of the (vaguely defi...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
We study the STORAGE ALLOCATION PROBLEM (SAP) which is a variant of the UNSPLITTABLE FLOW PROBLEM ON...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
We consider a memory allocation problem. This problem can be modeled as a version of bin packing whe...
AbstractWe present a dynamic embedding of the contents of a storage medium organized as an X-tree in...
This paper develops two probabilistic methods that allow the analysis of the maximum data structure ...
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, e...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
We show that it is possible to store a dynamic ordered set S of n integers drawn from a bounded univ...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
AbstractWe study the single-device Dynamic Storage Allocation (DSA) problem and the multi-device Bal...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
Interval allocation has been suggested as a possible formalization for the PRAM of the (vaguely defi...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
We study the STORAGE ALLOCATION PROBLEM (SAP) which is a variant of the UNSPLITTABLE FLOW PROBLEM ON...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
We consider a memory allocation problem. This problem can be modeled as a version of bin packing whe...
AbstractWe present a dynamic embedding of the contents of a storage medium organized as an X-tree in...
This paper develops two probabilistic methods that allow the analysis of the maximum data structure ...
In the Demand Strip Packing problem (DSP), we are given a time interval and a collection of tasks, e...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
We show that it is possible to store a dynamic ordered set S of n integers drawn from a bounded univ...