Finite size scaling approach to dynamic storage allocation problem
<|reference_start|>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 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.<|reference_end|>
@article{seyed-allaei2003finite,
    title={Finite size scaling approach to dynamic storage allocation problem},
    author={Hamed Seyed-allaei},
    journal={Physica A: Statistical Mechanics and its Applications, Volume 327,
  Issues 3-4, 15 September 2003, Pages 563-569},
    year={2003},
    doi={10.1016/S0378-4371(03)00509-0},
    archivePrefix={arXiv},
    eprint={cond-mat/0307058},
    primaryClass={cond-mat.stat-mech cs.DS}
}