Bin Packing and Dynamic File Storage: An 'Any-Fit' Algorithm Can Stabilize.

Abstract

In this paper we first consider the one-dimensional bin-packing problem and show that a class of "any-fit" algorithms can bound the expected wasted space in the system under certain conditions. In the second part of the paper we consider a dynamic file- storage problem and show, under certain conditions, that a class of "any-fit" algorithms can bound the expected wasted space left by deleted files.