sector mapping
In thi s scheme the memory and cache are divided into block s of 2^m byte s (the cache line size). A sector con si st s of 2^n con secutive block s. When a block i s cached, it i s read into the correct po sition in any sector of the cache, given by di scarding the bottom m addre ss bit s and taking the next n a s the block number within the sector. That whole sector i s then tagged with the remaining upper addre ss bit s and the other block s in the sector are marked a s invalid. Thi s scheme take s advantage of locality of reference to con secutive block s and need s fewer tag s thu s reducing the co st of a ssociative acce ss to the tag s. style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents: [ 2 ] [ = ] [ ad ] [ address ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bi ] [ bit ] [ block ] [ bo ] [ bot ] [ bottom ] [ by ] [ byte ] [ ca ] [ cache ] [ cache line ] [ card ] [ cc ] [ ch ] [ ci ] [ ck ] [ co ] [ con ] [ cons ] [ cu ] [ dd ] [ de ] [ ding ] [ disc ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ es ] [ fi ] [ file ] [ ge ] [ gi ] [ gs ] [ h ] [ hat ] [ hole ] [ hr ] [ hu ] [ id ] [ il ] [ in ] [ int ] [ io ] [ is ] [ it ] [ ke ] [ ki ] [ Lex ] [ li ] [ line ] [ locality ] [ ma ] [ memory ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ ns ] [ nu ] [ om ] [ pe ] [ ph ] [ query ] [ rc ] [ re ] [ reference ] [ sc ] [ se ] [ si ] [ sit ] [ so ] [ st ] [ T ] [ tag ] [ th ] [ to ] [ tt ] [ um ] [ up ] [ us ] [ va ] [ ve ] [ vi ] [ yt ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3926 Reads) |