Finite-size scaling approach to dynamic storage allocation problem

Hamed Seyed-allaei

Physica A: Statistical Mechanics and its Applications, 2003, vol. 327, issue 3, 563-569

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 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.

Keywords: Dynamic storage allocation algorithm; Finite-size scaling; Computer science; Statistical physics (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437103005090
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:327:y:2003:i:3:p:563-569

DOI: 10.1016/S0378-4371(03)00509-0

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().