OnlineWoerterBuecher.de
Internes

Lexikon


Best Fit


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)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ be ] [ bi ] [ block ] [ C ] [ ca ] [ cat ] [ ch ] [ ck ] [ co ] [ con ] [ cons ] [ data ] [ de ] [ diff ] [ du ] [ ed ] [ ee ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ First Fit ] [ fo ] [ for ] [ gh ] [ h ] [ hm ] [ hr ] [ ht ] [ id ] [ ie ] [ iff ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ Lex ] [ location ] [ ly ] [ ma ] [ mall ] [ memory ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ om ] [ pa ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ ro ] [ routine ] [ sc ] [ se ] [ si ] [ sm ] [ so ] [ source ] [ space ] [ st ] [ su ] [ sum ] [ T ] [ th ] [ to ] [ tr ] [ tw ] [ ua ] [ ug ] [ um ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3806 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.092 Seconds, with 17 Database-Queries
Zurück zur Startseite