Finite size scaling approach to dynamic storage allocation problem

TL;DR

This paper introduces a finite size scaling method to analyze dynamic storage allocation algorithms, demonstrating its effectiveness on first-fit, next-fit, and best-fit algorithms by examining speed and memory usage.

Contribution

It presents a novel finite size scaling approach for analyzing dynamic storage algorithms, providing a systematic way to determine relevant exponents and scaling functions.

Findings

A simple scaling function exists for all studied algorithms.

Relevant exponents are calculated for speed and memory usage.

The method can be applied to similar problems beyond storage allocation.

Abstract

It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite size scaling. The method is illustrated in the three simple cases of the it first-fit, next-fit and it best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view - running speed and employed memory. In both cases, and for all algorithms, it is shown that a simple scaling function exists and the relevant exponents are calculated. The method can be applied on similar problems as well.