## Finite size scaling approach to dynamic storage (2003)

### BibTeX

@MISC{Seyed-allaei03finitesize,

author = {Hamed Seyed-allaei},

title = {Finite size scaling approach to dynamic storage},

year = {2003}

}

### OpenURL

### Abstract

allocation problem

### Citations

2318 |
The art of computer programming
- KNUTH
- 1973
(Show Context)
Citation Context ...size scaling [2] as a tool to study dynamic storage allocation algorithms. We are going to use the same terminology of critical phenomena in the present context. We have chosen a well defined problem =-=[3]-=- - a comparison of speed and memory usage among three simple allocation algorithms: first-fit, next-fit and best-fit algorithm. Nevertheless, this can also be done with other algorithms which are appl... |

222 | Dynamic Storage Allocation: A Survey and Critical Review
- Wilson, Johnstone, et al.
- 1995
(Show Context)
Citation Context ...ay the size distribution of free blocks in the free list will be uniform hence the algorithm will be faster[3]. There are many other algorithms such as buddy-system, next-fit and indexedfit algorithms=-=[3,4]-=-. A particular choice might be dictated by bottlenecks of the storage device, size distribution function of requests or their life span. For example if a large memory is available the buddy-system may... |

122 | Virtual memory
- Denning
- 1970
(Show Context)
Citation Context ...memory to increase by the necessary amount when needed. In fact in this way, the memory size is a variable which can be measured during the simulation. This is similar to a system with virtual memory =-=[8]-=-. The simulation runs until the system reaches the stationary state. Then one starts to measure the density of allocated memory on the device and the searching time. Density, d, is defined as the rati... |

20 |
Worst case fragmentation of first fit and best fit storage allocation strategies
- Robson
- 1977
(Show Context)
Citation Context ...t. Many attempts have been made; these attempts answer this question and compare different algorithms from different points of view like performance or probability to have the worst case fragmentation=-=[6,7]-=-. 3We aim to study and compare speed and memory usage, using tools of statistical physics like finite size scaling for simple algorithms: the first-fit, next-fit and best-fit algorithms with address-... |

9 |
The theory of critical point singularities
- Fisher
- 1971
(Show Context)
Citation Context ...mounts of data and resources. Some examples of these algorithms are storage allocation algorithms and file systems and search and indexing algorithms. In this work we will present finite size scaling =-=[2]-=- as a tool to study dynamic storage allocation algorithms. We are going to use the same terminology of critical phenomena in the present context. We have chosen a well defined problem [3] - a comparis... |

9 |
Dynamic memory allocation in computer simulation
- Nielsen
- 1977
(Show Context)
Citation Context ...t. Many attempts have been made; these attempts answer this question and compare different algorithms from different points of view like performance or probability to have the worst case fragmentation=-=[6,7]-=-. 3We aim to study and compare speed and memory usage, using tools of statistical physics like finite size scaling for simple algorithms: the first-fit, next-fit and best-fit algorithms with address-... |