A Comparison of Next-fit, First-fit, and Best-fit

@article{Bays1977ACO,
  title={A Comparison of Next-fit, First-fit, and Best-fit},
  author={Carter Bays},
  journal={Commun. ACM},
  year={1977},
  volume={20},
  pages={191-192}
}
“Next-fit” allocation differs from first-fit in that a first-fit allocator commences its search for free space at a fixed end of memory, whereas a next-fit allocator commences its search wherever it previously stopped searching. This strategy is called “modified first-fit” by Shore [2] and is significantly faster than the first-fit allocator. To evaluate the relative efficiency of next-fit (as well as to confirm Shore's results) a simulation was written in Basic Plus on the PDP-11, using doubly… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

Similar Papers

Loading similar papers…