{"id":31,"date":"2020-11-25T18:41:06","date_gmt":"2020-11-25T23:41:06","guid":{"rendered":"https:\/\/www.alpharithms.com\/?p=31"},"modified":"2021-07-27T11:23:41","modified_gmt":"2021-07-27T15:23:41","slug":"types-of-cache-memory","status":"publish","type":"post","link":"https:\/\/www.alpharithms.com\/types-of-cache-memory-064118\/","title":{"rendered":"Types of Cache Memory"},"content":{"rendered":"

Cache memory is a type of computer memory designed to take advantage of the principles of locality<\/em>. This principle states that once the data at a memory location is accessed, that data tends to be accessed again and that data near that memory address tends to be accessed in the near future.<\/p>\n

Cache memory takes advantage of these principles to provide the CPU access to data stored in memory as efficiently as possible. There are several ways of designing caches to help facilitate this goal in a range of different scenarios. As with most software architecture\u2014each comes with tradeoffs.<\/p>\n

Direct Mapped<\/h2>\n
\"direct
Direct-mapped cache memory associates a single cache block to a single block in main memory<\/figcaption><\/figure>\n

A single block of memory is mapped to a single block of the cache. The corresponding cache block can be calculated by mem_addr % # cache_block_count<\/code>. This means the 5th block of memory would map to the 1st block of a 4 block cache because 5 % 4 = 1<\/code>.<\/p>\n

N-Set Associative<\/h2>\n
\"n
N-Way Set Association divides the total cache memory blocks into “sets” in which specific lines can be addressed<\/figcaption><\/figure>\n

Set associative mapping divides the cache blocks into sets, such that a block of data from main memory could map to multiple positions in a single set. For example, if an 8-block cache were 2-way set associative, it would be divided into 4 sets of 2 blocks. Each of these sets could contain 2 blocks of data from main memory, differentiated by their tag numbers. Set associative indexing is calculated using mem_addr % cache_set_count<\/code>.<\/p>\n

Fully Associative<\/h2>\n
\"fully
A fully-associative cache is the functional equivalent of a direct-mapped cache<\/figcaption><\/figure>\n

Fully associative mapping is similar to N-Set Associative mapping, just that the number of sets in cache memory is equal to the number of blocks.<\/p>\n

Where two-way associative mapping dictates 8 blocks of cache memory be subdivided into 4 blocks of two sets; fully associative mapping would dictate those 8 blocks of cache memory be subdivided into 8 sets of memory.<\/p>\n

Effectively, this means that a block of memory from main memory could be written to any block in cache memory. This means lookups can be hardware-intensive and often inefficient.<\/p>\n

Discussion<\/h2>\n

Cache-memory design involves a balance of size vs. performance. The types of cache memory discussed here represent two major approaches of cache memory design: n-way set associative and direct-mapped. Direct-mapped caches are much simpler to implement but result in lower performance.<\/p>\n

N-way set-associative cache design allows flexibility and faster performance under common cases in modern computing. The extra resources required to implement this cache type are often more than justified by performance gains (R<\/a>).<\/p>\n","protected":false},"excerpt":{"rendered":"

Cache memory is a type of computer memory designed to take advantage of the principles of locality. This principle states that once the data at a memory location is accessed, that data tends to be accessed again and that data near that memory address tends to be accessed in the near future. Cache memory takes […]<\/p>\n","protected":false},"author":2,"featured_media":38,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"categories":[1,260],"tags":[24,26,25],"acf":[],"_links":{"self":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/31"}],"collection":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/comments?post=31"}],"version-history":[{"count":3,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/31\/revisions"}],"predecessor-version":[{"id":39,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/31\/revisions\/39"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/media\/38"}],"wp:attachment":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/media?parent=31"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/categories?post=31"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/tags?post=31"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}