Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
