Finite-size scaling approach to dynamic storage allocation problem

✍ Scribed by Hamed Seyed-allaei

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 116 KB
• Volume: 327
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/s0378-4371(03)00509-0

✦ Synopsis

It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of ÿnite-size scaling. The method is illustrated in the three simple cases of the ÿrst-ÿt, next-ÿt and best-ÿt algorithms, and the system works at full capacity. The analysis is done from two di erent 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.