Finite-size scaling approach to dynamic storage allocation problem

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 first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different points...

Full description

Saved in:

Bibliographic Details
Published in:	Physica A Vol. 327; no. 3; pp. 563 - 569
Main Author:	Seyed-allaei, Hamed
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.09.2003
Subjects:	Computer science Dynamic storage allocation algorithm Finite-size scaling Statistical physics Computer science 89.80.+h 05.90.+m Dynamic storage allocation algorithm Statistical physics Finite-size scaling
ISSN:	0378-4371, 1873-2119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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 first-fit, next-fit and 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.
ISSN:	0378-4371 1873-2119
DOI:	10.1016/S0378-4371(03)00509-0