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)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 - (3827 Reads)

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

Page Generation in 0.0905 Seconds, with 16 Database-Queries
Zurück zur Startseite