Abstract
The space allocation process in a fragmented linear store with general fragmentation characteristics is analysed. For a given allocation requirement t, exact expression for the n-th moment of the allocation penalty for single block contiguous allocation is obtained, which for large t is shown to be O(¯F(t)−n), where ¯F(·) is the complementary distribution function of the free block sizes. For multiple block non-contiguous allocation, it is shown that the corresponding penalty can be approximated by an n-th degree polynomial and is O(tn) for large t. Compared with experimental values, the model results are able to achieve good agreement.
Sign-in/Register to access full text options 
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.
