Summary
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(t n) for large t. Compared with experimental values, the model results are able to achieve good agreement.
Similar content being viewed by others
References
Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. New York: Dover 1965
Feller, W.: An Introduction to Probability Theory and Its Applications. 2nd ed., Vol. 2. New York: Wiley 1971
Kendall, M., Stuart, A.: The Advanced Theory of Statistics. 3rd ed., Vol. 1. London: Griffin 1969
Kleinrock, L.: Queueing Systems. Vol. 1. New York: Wiley 1975
Leung, C.H.C.: A simple model for the performance analysis of disc storage fragmentation. Comput. J. 25, 193–198 (1982)
Leung, C.H.C.: Analysis of secondary storage fragmentation. IEEE Trans. Software Eng. 9, 87–93 (1983)
Riordan, J.: An Introduction to Combinatorial Analysis. New York: Wiley 1958
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Leung, C.H.C. Analysis of space allocation in a generally fragmented linear store. Acta Informatica 24, 93–104 (1987). https://doi.org/10.1007/BF00290708
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00290708