Analysis of a Cyclic Placement Scheme
I. P. Page · The Computer Journal · 1984
This paper considers a simple scheme for dynamic storage allocation and shows that an analysis is possible through use of probability theory and the theory of renewal point processes. A placement scheme is considered which attempts to keep storage highly compact and obviates the need for time consuming scanning of free storage lists. An analysis of the storage loss due to fragmentation is presented together with the results of simulation experiments. The study indicates that, although the chosen scheme is amenable to theoretical analysis, it is inferior in performance to other well known schemes for dynamic storage allocation. A modification to the scheme is presented which gives utilization comparable with first fit but has lower free list searching overheads.