A time- and space-efficient garbage compaction algorithm
Communications of the ACM
The Logical Design of Operating Systems
The Logical Design of Operating Systems
Operating system principles
Operating Systems Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Operating Systems
| Hi-index | 0.05 |
In this paper, the problem of dynamic memory allocation with limited compaction of contigious segments, is considered. To be more precise, we are concerned with the problem of finding, given the storage state, a free storage space of a given size by reallocating segments whose total size is minimal. The general case of this problem will be proved to be NP-hard. It is, however, possible to give a linear time algorithm for solving a restricted case, involving only a few types of segment sizes. Moreover, for the general case we present several bounds on the storage size ensuring the possibility of finding in linear time a free space of the desired size by reallocating not more than L memory cells.