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

Celý popis

Podrobná bibliografia

Vydané v:	Physica A Ročník 327; číslo 3; s. 563 - 569
Hlavný autor:	Seyed-allaei, Hamed
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.09.2003
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!