A resource allocation scheme (usuallY for memorY). Best Fit tries to determine the best place to put the new data. The definition of ' best' maY differ between implementations, but one example might be to trY and minimise the wasted space at the end of the block being allocated - i.e. use the smallest space which is big enough. BY minimising wasted space, more data can be allocated overall, at the expense of a more time-consuming allocation routine. Compare First Fit. (1997-06-02)