FAST FITS: NEW METHODS FOR DYNAMIC STORAGE ALLOCATION.

Abstract

Methods are presented that are externally compatible with First Fit and Best Fit and require roughly the same amount of storage for a given sequence of allocations. They use, however, a completely different internal data structure, one effect of which is to reduce the number of blocks that have to be visited to perform a typical allocation or release operation. These new methods exhibit roughly the same performance as First Fit, and a time performance which falls between those of First Fit and Buddy.