Year: 1999
Type: report
Abstract: In 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 subclass 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. 1 Introduction Formally, the DSA problem is the following: Definition 1: Let be the set of intervals (corresponding to the arrays). Let , the number of elements in . For each , is the time at which it becomes live, is the time at which it dies, and is the width of interval ; the width represents, for example, the size of an array that needs allocation. Note that the duration of an interval is . Given the values for each , and an integer , is there an allocation of these intervals that require...
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2144051412