Memory utilization efficiency under a class of first-fit algorithms

  • Authors:
  • Aaron Tenenbaum

  • Affiliations:
  • -

  • Venue:
  • ACM '80 Proceedings of the ACM 1980 annual conference
  • Year:
  • 1980

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper examines an improved version of a modified first-fit storage allocation algorithm. In this version, small blocks of free storage are not permitted to remain on the free list but instead are placed on a separate sliver list, available for recombination with newly freed blocks. The memory utilization efficiency of a system under this algorithm is shown to be markedly superior to a system using an algorithm in which such blocks are unavailable for either allocation or recombination.