In this scheme the memory and cache are divided into blocks of 2^m bytes (the cache line size). A sector consists of 2^n consecutive blocks. When a block is cached, it is read into the correct position in any sector of the cache, given by discarding the bottom m address bits and taking the next n as the block number within the sector. That whole sector is then tagged with the remaining upper address bits and the other blocks in the sector are marked as invalid. This scheme takes advantage of locality of reference to consecutive blocks and needs fewer tags thus reducing the cost of associative access to the tags.

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 ]