|
| | | | |
| | | |
| Stat |
Members: 3644
Articles: 2'499'343
Articles rated: 2609
16 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Finite size scaling approach to dynamic storage allocation problem | | Hamed Seyed-allaei
; | | Date: |
2 Jul 2003 | | Journal: | Physica A: Statistical Mechanics and its Applications, Volume 327, Issues 3-4, 15 September 2003, Pages 563-569 DOI: 10.1016/S0378-4371(03)00509-0 | | Subject: | Statistical Mechanics; Data Structures and Algorithms | cond-mat.stat-mech cs.DS | | 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 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. | | Source: | arXiv, cond-mat/0307058 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER