Finite size scaling approach to dynamic storage allocation problem
| dc.creator | Seyed-allaei, Hamed | |
| dc.date | 2003-07-02 | |
| dc.date.accessioned | 2026-07-07T02:52:10Z | |
| dc.date.available | 2026-07-07T02:52:10Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 4 figures, will apear in Physica A | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0307058 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0307058 | |
| dc.identifier | Physica A: Statistical Mechanics and its Applications, Volume 327, Issues 3-4, 15 September 2003, Pages 563-569 | |
| dc.identifier | doi:10.1016/S0378-4371(03)00509-0 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/21740 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Finite size scaling approach to dynamic storage allocation problem | |
| dc.type | text |