Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
List of cache coherency protocols
open-in-new
<h2 id="cache-coherency-problem">Cache coherency problem</h2> <p>In systems as <a href="/facts/Multiprocessor_system_architecture/WY03loA6">Multiprocessor system</a>, <a href="/facts/Multi-core_processor/ABNb65hQ">multi-core</a> and <a href="/facts/Non-uniform_memory_access/MpmN5mN0">NUMA system</a>, where a dedicated cache for each <i>processor</i>, <i>core</i> or <i>node</i> is used, a consistency problem may occur when a same data is stored in more than one cache. This problem arises when a data is modified in one cache. This problem can be solved in two ways: </p> <ol><li>Invalidate all the copies on other caches (broadcast-invalidate)</li> <li>Update all the copies on other caches (write-broadcasting), while the memory may be updated (write through) or not updated (write-back).</li></ol> <p>Note: Coherency generally applies only to data (as operands) and not to instructions (see Self-Modifying Code). </p><p>The schemes can be classified based on: </p> <ul><li>Snoopy scheme vs Directory scheme and vs Shared caches</li> <li>Write through vs Write-back (ownership-based) protocol</li> <li>Update vs Invalidation protocol</li> <li>Intervention vs not Intervention</li> <li>Dirty-sharing vs not-dirty-sharing protocol (MOESI vs MESI)</li></ul> <p>Three approaches are adopted to maintain the coherency of data. </p> <ul><li>Bus watching or Snooping – generally used for bus-based SMP – Symmetric Multiprocessor System/multi-core systems</li> <li>Directory-based – Message-passing – may be used in all systems but typically in NUMA system and in large multi-core systems</li> <li>Shared cache – generally used in multi-core systems</li></ul> <h2 id="snoopy-coherency-protocol">Snoopy coherency protocol</h2> <p>Protocol used in bus-based systems like a SMP systems </p> <h3>SMP – symmetric multiprocessor systems</h3> <blockquote> <p>Systems operating under a single OS (<a href="/facts/Operating_system/8XTuvMh2">Operating System</a>) with two or more homogeneous processors and with a centralized shared <a href="/facts/Main_memory/wPHKFpdx">Main Memory</a> </p> </blockquote> <p>Each processor has its own cache that acts as a bridge between processor and <a href="/facts/Main_memory/wPHKFpdx">Main Memory</a>. The connection is made using a <a href="/facts/System_bus/p1mxHpbb">System Bus</a> or a <a href="/facts/Crossbar_switch/fSDXkMzf">Crossbar</a> ("xbar") or a mix of two previously approach, bus for address and crossbar for Data (Data crossbar).<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a><a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p><p>The bottleneck of these systems is the traffic and the Memory bandwidth. Bandwidth can be increasing by using large data bus path, data crossbar, <a href="/facts/Memory_interleaving/UPt7yxW9">memory interleaving</a> (multi-bank parallel access) and <i><a href="/facts/Out-of-order_execution/bM0dQM8m">out of order</a></i> data transaction. The traffic can be reduced by using a cache that acts as a <i>"filter"</i> versus the shared memory, that is the cache is an essential element for shared-memory in SMP systems. </p><p>In multiprocessor systems with separate caches that share a common memory, a same datum can be stored in more than one cache. A data consistency problem may occur when data is modified in one cache only. The protocols to maintain the coherency for multiple processors are called cache-coherency protocols. </p><p>Usually in SMP the coherency is based on the <i>"Bus watching"</i> or <i>"<a href="/facts/Bus_sniffing/NUxKS0mb">Snoopy</a>"</i> (after the Peanuts' character <i><a href="/facts/Snoopy/lw4gUzcu">Snoopy</a></i> ) approach. In a snooping system, all the caches monitor (or snoop) the bus transactions to intercept the data and determine if they have a copy on its cache. </p><p>Various cache-coherency protocols are used to maintain data coherency between caches.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> </p><p>These protocols are generally classified based only on the cache states (from 3 to 5 and 7 or more) and the transactions between them, but this could create some confusion. </p><p>This definition is incomplete because it lacks important and essential information as the actions that these produce. These actions can be invoked by the processor or the bus controller (e.g. intervention, invalidation, broadcasting, etc.). The type of actions are implementation dependent. The states and transaction rules do not capture everything about a protocol. For instance protocol MESI with shared-intervention on unmodified data and MESI without intervention are different (see below). At the same time, some protocols with different states can be practically the same. For instance, the 4-state MESI Illinois and 5-state MERSI (R-MESI) IBM / MESIF-Intel protocols are only different implementations of the same functionality (see below). </p><p>The most common protocols are the 4-state MESI and the 5-state MOESI, each letter standing for one of the possible states of the cache. Other protocols use some proper subset of these but with different implementations along with their different but equivalent terminology. The terms MESI, MOESI or any subset of them generally refer to a <i>class</i> of protocols instead of a specific one. </p> <h3>Cache states</h3> <p>The states MESI and MOESI are often and more commonly called by different names. </p> <ul><li>M=<i>Modified</i> or D=<i>Dirty</i> or DE=<i>Dirty-Exclusive</i> or EM=<i>Exclusive Modified</i> <ul><li>modified in one cache only – write-back required at replacement.</li> <li>data is stored only in one cache but the data in memory is not updated (invalid, not clean).</li></ul></li> <li>O=<i>Owner</i> or SD=<i>Shared Dirty</i> or SM=<i>Shared Modified</i> or T=<i>Tagged</i> <ul><li>modified, potentially shared, owned, write-back required at replacement.</li> <li>data may be stored in more than a cache but the data in memory is not updated (invalid, not clean). Only one cache is the "owner", other caches are set "Valid" (S/V/SC). On bus read request, the data is supplied by the "owner" instead of the memory.</li></ul></li> <li>E=<i>Exclusive</i> or R=<i>Reserved</i> or VE=<i>Valid-Exclusive</i> or EC=<i>Exclusive Clean</i> or Me=<i>Exclusive</i> <ul><li>clean, in one cache only.</li> <li>Data is stored only in one cache and <i>clean</i> in memory.</li></ul></li> <li>S=<i>Shared</i> or V=<i>Valid</i> or SC=<i>Shared Clean</i> <ul><li>shared or valid</li> <li>Data potentially shared with other caches. The data can be clean or dirty. The term "clean" in SC is misleading because can be also dirty (see Dragon protocol).</li></ul></li> <li>I=<i>Invalid</i>. <ul><li>Cache line invalid. If the cache line is not present (no tag matching) it is considered equivalent to invalid, therefore invalid data means data present but invalid or not present in cache.</li></ul></li></ul> <p>Special states: </p> <ul><li>F=<i>Forward</i> or R=<i>Recent</i> <ul><li>Additional states of MESI protocol</li> <li>Last data read. It is a special "Valid" state that is the "Owner" for <i>non modified shared data</i>, used in some extended MESI protocols (MERSI or R-MESI IBM,<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> MESIF – Intel<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a><a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a>). The R/F state is used to allow "intervention" when the value is clean but shared among many caches. This cache is responsible for intervention (<i>shared intervention</i> ). On bus read request, the data is supplied by this cache instead of the memory. MERSI and MESIF are the same protocol with different terminology (F instead of R). Some time R is referred as "<i>shared last </i>" (SL).<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a><a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></li> <li>The state R = Recent is used not only in MERSI = R-MESI protocol but in several other protocols. This state can be used in combination with other states. For instance RT-MESI, HR-MESI, HRT-MESI, HRT-ST-MESI.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a><a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a><a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> All protocols that use this state will be refereed as R-MESI type.</li></ul></li> <li>H=<i>Hover</i> – H-MESI (additional state of MESI protocol)<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> <ul><li>The Hover (H) state allows a cache line to maintain an address Tag in the directory even though the corresponding value in the cache entry is an invalid copy. If the correspondent value happens on the bus (address Tag matching) due a valid "Read" or "Write" operation, the entry is updated with a valid copy and its state is changed in S.</li> <li>This state can be used in combination with other states. For instance HR-MESI, HT-MESI, HRT-MESI, HRT-ST-MESI.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a><a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a></li></ul></li></ul> <h3>Various coherency protocols</h3> <table><tbody><tr><th></th><th>Protocols</th></tr><tr><td>SI protocol</td><td>Write Through</td></tr><tr><td>MSI protocol</td><td>Synapse protocol<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a></td></tr><tr><td>MEI protocol</td><td>IBM <a href="/facts/PowerPC_7xx/SfPRudfh">PowerPC 750</a>,<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> MPC7400<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></td></tr><tr><td>MES protocol</td><td>Firefly protocol<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></td></tr><tr><td>MESI protocol</td><td>Pentium II,<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> PowerPC, Intel Harpertown (Xeon 5400)</td></tr><tr><td>MOSI protocol</td><td>Berkeley protocol<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a></td></tr><tr><td>MOESI protocol</td><td><a href="/facts/AMD64/cyWvUFlP">AMD64</a>,<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> MOESI,<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> T-MESI IBM<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a></td></tr></tbody></table> <table><tbody><tr><th>Terminology used</th><th></th></tr><tr><td>Illinois protocol</td><td>D-VE-S-I (= extended MESI)<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a><a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a></td></tr><tr><td>Write-once or Write-first</td><td>D-R-V-I (= MESI) <a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a><a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a><a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a></td></tr><tr><td>Berkeley protocol</td><td>D-SD-V-I (= MOSI) <a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a></td></tr><tr><td>Synapse protocol</td><td>D-V-I (= MSI) <a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a></td></tr><tr><td>Firefly protocol</td><td>D-VE-S (= MES) DEC<a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a></td></tr><tr><td>Dragon protocol</td><td>D-SD (SM ?)-SC-VE (= MOES) Xerox<a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a></td></tr><tr><td>Bull HN ISI protocol</td><td>D-SD-R-V-I (= MOESI)<a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a></td></tr><tr><td>MERSI (IBM) / MESIF (Intel) protocol</td><td><ul><li>R=Recent – IBM <a href="/facts/PowerPC_G4/llrBTyVn">PowerPC G4</a>, MPC7400<a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a><a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a></li><li>F=Forward – Intel<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a> Intel Nehalem<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a><a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a><a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a></li></ul></td></tr><tr><td>HRT-ST-MESI protocol</td><td>H=Hover, R=Recent, T=Tagged, ST=Shared-Tagged – IBM<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a><a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a><p>– Note: The main terminologies are SD-D-R-V-I and MOESI and so they will be used both.</p></td></tr><tr><td>POWER4 IBM protocol</td><td>Mu-T-Me-M-S-SL-I ( L2 seven states)<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a><ul><li>Mu=<i>Unsolicited Modified – Modified Exclusive</i> – (D/M) (*)</li><li>T=<i>Tagged – Modified Owner not Exclusive</i> (SD/O)</li><li>M=<i>Modified Exclusive</i> – (D)</li><li>Me=<i>Valid Exclusive</i> – (R/E)</li><li>S=<i>Shared</i> – (V)</li><li>SL=<i>Shared Last – Sourced local</i> – (Shared Owner Local)</li><li>I=<i>Invalid</i> – (I)</li></ul><p>(*) Special state – Asking for a reservation for load and store doubleword (for 64-bit implementations).</p></td></tr></tbody></table> <h3>Snoopy coherency operations</h3> <ul><li>Bus Transactions</li> <li>Data Characteristics</li> <li>Cache Operations</li></ul> <h4>Bus transactions</h4> <p>The main operations are: </p> <ul><li>Write Through</li> <li>Write-Back</li> <li>Write Allocate</li> <li>Write-no-Allocate</li> <li><i>Cache Intervention</i> <ul><li><i>Shared Intervention</i></li> <li><i>Dirty Intervention</i></li></ul></li> <li><i>Invalidation</i></li> <li><i>Write-broadcast</i></li> <li><i>Intervention-broadcasting</i></li></ul> <p>Write Through </p> <ul><li>The cache line is updated both in cache and in MM or only in MM (<i>write no-allocate</i>).</li> <li>Simple to implement, high bandwidth consuming. It is better for single write.</li></ul> <p>Write-Back </p> <ul><li>Data is written only in cache. Data is Write-Back to MM only when the data is replaced in cache or when required by other caches (see Write policy).</li> <li>It is better for multi-write on the same cache line.</li> <li>Intermediate solution: <i>Write Through</i> for the first write, <i>Write-Back</i> for the next (Write-once and Bull HN ISI<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a> protocols).</li></ul> <p>Write Allocate </p> <ul><li>On miss the data is read from the "owner" or from MM, then the data is written in cache (updating-partial write) (see Write policy).</li></ul> <p>Write-no-Allocate </p> <ul><li>On miss the data is written only in MM without to involve the cache, or as in Bull HN ISI protocol, in the "owner" that is in D or SD cache (owner updating), if they are, else in MM.</li> <li>Write-no-Allocate usually is associated with Write Through.</li> <li>Cache Intervention</li></ul> (or shortly "<i>intervention</i> ") – Shared Intervention – shared-clean intervention (on unmodified data) – On <i>Read Miss</i> the data is supplied by the owner E or R/F or also S instead of the MM (see protocols Illinois, IBM R-MESI type and Intel MESIF). – Dirty Intervention (on modified data) – On <i>Read Miss</i> the data is supplied by the M (D) or O (SD) owner or by E (R) (*) instead of MM (e.g. MOESI protocol, RT-MESI, …). (*) – Not for E (R) in the original proposal MOESI protocol<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a> and in some other implementations MOESI-Type. – "<i>Intervention</i> " is better compared to the "<i>not intervention</i> " because <i>cache-to-cache</i> transactions are much more faster than a MM access, and in addition it save memory bandwidth (memory traffic reduction). Extended MESI Illinois and R-MESI type / MESIF are therefore much better than the MOESI protocol (see MESI vs MOESI below) <ul><li>Invalidation</li></ul> – On <i>Write Hit</i> with S (V) or O (SD) (shared) state, a bus transaction is sent to invalidate all the copies on the other caches (<i>Write-invalidate</i>). <ul><li>Write-broadcast (Write-update)</li></ul> – On <i>Write Hit</i> with S (V) or O (SD) (shared) state, a write is forward to other caches to update their copies (e.g. Intel Nehalem<a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a> Dragon protocol, Firefly (DEC). – Note – The updating operation on the other caches some time is called also <i>Snarfing</i>. The caches snoop the bus and if there is a hit in a cache, this cache <i>snarfs</i> the data that transits on the bus and update its cache. Also the updating of the H in (H-MESI) state can be defined as <i>snarfing</i>. In the first case this happens in a write broadcast operation, on the second case both in read and write operations. <ul><li>Intervention-broadcasting</li></ul> – On an Intervention transaction, a cache with H state (H-MESI) updates its invalid copy with the value sent on the bus and its state is changed in S.<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a> <ul><li>Write invalidate vs broadcast</li></ul> – Write Invalidate is better when multiple writes, typically partial write, are done by a processor before that the cache line is read by another processor. – Write-broadcast (updating) is better when there is a single producer and many consumers of data, but it is worse when a cache is filled with data that will be not next read again (bus traffic increasing, cache interference increasing). - Invalidation is the common solution. <h4>Data characteristics</h4> <p>There are three characteristics of cached data: </p> <ul><li><i>Validity</i></li> <li><i>Exclusiveness</i></li> <li><i>Ownership</i></li> <li>Validity</li></ul> – Any not invalid cache line, that is MOES / D-SD-R-V. <ul><li>Exclusiveness</li></ul> – Data valid only in one cache (data not shared) in M (D) or E (R) state, with MM not clean in case of M (D) and clean in case of E (R). <ul><li>Ownership</li></ul> – The cache that is responsible to supply the request data instead of a MM (Intervention) – Depending on the protocol, cache who must make the intervention can be S-E-M in MESI Illinois, or R/F-E-M in R-MESI type / MESIF or M (D) or O (SD) or also E (R) (*) in MOESI-type protocols, (e.g. <a href="/facts/AMD64/cyWvUFlP">AMD64</a>,<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a> Bull HN ISI<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a> – see "Read Miss" operation below). <p>(*) – Implementation depending. </p><p>Note: Not to confuse the more restrictive "owner" definition in MOESI protocol with this more general definition. </p> <h4>Cache operations</h4> <p>The cache operations are: </p> <ul><li><i>Read Hit</i></li> <li><i>Read Miss</i></li> <li><i>Write Hit</i></li> <li><i>Write Miss</i></li> <li>Read Hit</li></ul> – Data is read from cache. The state is unchanged – Warning: since this is an obvious operation, afterwards it will not be more considered, also in state transaction diagrams. <ul><li>Read Miss</li></ul> – The data read request is sent to the bus – There are several situations: <ul><li>Data stored only in MM</li></ul> – The data is read from MM. – The cache is set E (R) or S (V) – E (R) if a special bus line ("<i>Shared line</i> ") is used to detect "<i>no data sharing</i> ". Used in all protocols having E (R) state except for Write-Once and Bull HN ISI protocols (see "Write Hit" below). <ul><li>Data stored in MM and in one or more caches in S (V) state or in R/F in R-MESI type / MESIF protocols.</li></ul> – There are three situations: <ol><li>– Illinois protocol – a network priority is used to temporary and arbitrary assign the ownership to a S copy. - Data is supplied by the selected cache. Requesting cache is set S (shared intervention with MM clean).</li> <li>– R-MESI type / MESIF protocols – a copy is in R/F state (shared owner) – The data is supplied by the R/F cache. Sending cache is changed in S and the requesting cache is set R/F (in read miss the "ownership" is always taken by the last requesting cache) – shared intervention.</li> <li>– In all the other cases the data is supplied by the memory and the requesting cache is set S (V).</li></ol> <ul><li>Data stored in MM and only in one cache in E (R) state.</li></ul> <ol><li>– Data is supplied by a E (R) cache or by the MM, depending on the protocol. – From E (R) in extended MESI (e.g. Illinois, Pentium (R) II <a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a>), R-MESI type / MESIF and from same MOESI implementation (e.g. <a href="/facts/AMD64/cyWvUFlP">AMD64</a>) – The requesting cache is set S (V), or R/F in R-MESI type / MESIF protocols and E (R) cache is changed in S (V) or in I in MEI protocol.</li> <li>– In all the other cases the data is supplied by the MM.</li></ol> <ul><li>Data modified in one or more caches with MM not clean</li></ul> <ul><li>Protocol MOESI type – Data stored in M (D) or in O (SD) and the other caches in S (V)</li></ul> – Data is sent to the requesting cache from the "owner" M (D) or O (SD). The requesting cache is set S (V) while M (D) is changed in O (SD). – The MM is not updated. <ul><li> Protocols MESI type and MEI – Data stored in M (D) and the other caches in S (V) state</li></ul> – There are two solutions: <ol><li>– Data is sent from the M (D) cache to the requesting cache and also to MM (e.g. Illinois, Pentium (R) II <a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a>)</li> <li>– The operation is made in two steps: the requesting transaction is stopped, the data is sent from the M (D) cache to MM then the wait transaction can proceed and the data is read from MM (e.g. MESI and MSI Synapse protocol).</li></ol> – All cache are set S (V) <ul><li>Write Hit</li></ul> – The data is written in cache – There are several situations: <ul><li>Cache in S (V) or R/F or O (SD) (sharing)</li></ul> – Write invalidate – Copy back – The data is written in cache and an invalidating transaction is sent to the bus to invalidate all the other caches – The cache is set M (D) – Write Through (Write-Once, Bull HN ISI) – Data is written in cache and in MM invalidating all the other caches. The cache is set R (E) – Write broadcasting (e.g. Firefly, Dragon) - The data is written in cache and a broadcasting transaction is sent to the bus to update all the other caches having a copy – The cache is set M (D) if the "shared line" is off, otherwise is set O (SD). All the other copies are set S (V) <ul><li>Cache in E (R) or M (D) state (exclusiveness)</li></ul> – The write can take place locally without any other action. The state is set (or remains) M (D) <ul><li>Write Miss</li></ul> – Write Allocate – Read with Intent to Modified operation (RWITM) – Like a Read miss operation plus an invalidate command, then the cache is written (updated) – The requesting cache is set M (D), all the other caches are invalidated – Write broadcasting (e.g. Firefly, Dragon) – Like with a Read Miss. If "shared line" is "off" the data is written in cache and set M (D), otherwise like with a Write Hit – Write Broadcasting – Write-no-Allocate – The data is sent to MM, or like in Bull HN ISI protocol, only to the D (M) or SD (O) cache if they are, bypassing the cache. <h2 id="coherency-protocols">Coherency protocols</h2> – warning – For simplicity all Read and Write "miss" state transactions that obviously came from I state (or Tag miss), in the diagrams are not depicted. They are depicted directly on the new state. – Note – Many of the following protocols have only historical value. At the present the main protocols used are R-MESI type / MESIF and HRT-ST-MES (MOESI type) or a subset of this. <h3>MESI protocol</h3> <p> States MESI = D-R-V-I </p> – Use of a bus "shared line" to detect "shared" copy in the other caches <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> There are two alternative implementations: standard MESI (not intervention) and extended MESI (with intervention) 1 – MESI "no Intervention" (e.g. PowerPC 604 <a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a>) – If there is a M copy in a cache, the transaction is stopped and wait until the M cache updates the MM, then the transaction can continue and the data is read from MM. Both caches are set S – else the data is read from MM. If the "shared line" is "on" the cache is set S else E 2 – MESI "Intervention" from M and E (e.g. Pentium (R) II <a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a>) – If there is a M or E copy (exclusiveness) in a cache, the data is supplied to the requesting cache from M or from E (Intervention). If the sending cache is M the data is also written at the same time in MM (copy back). All caches are set S – else the data is read from MM. If the "shared line" is "on" the cache is set S else E <ul><li>Write Hit</li></ul> – If the cache is M or E (exclusiveness), the write can take place locally without any other action – else the data is written in cache and an invalidating transaction is sent to the bus to invalidate all the other caches – The cache is set M <ul><li>Write Miss</li></ul> – RWITM operation is sent to the bus. The operation is made in two step: a "Read Miss" with "invalidate" command to invalidate all the other caches, then like with a "Write Hit" with the state M (see Cache operation-Write Miss). <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> – if M and "no Intervention" the data is sent to MM (Copy Back) – if M and "Intervention" the data is sent to requesting cache and to MM (Copy Back) – if E (*) and "Intervention" the data sent to requesting cache – The state is changed (or remains) in S <ul><li>Bus Read – (RWITM)</li></ul> – As like with "Bus read" – The cache is set "Invalid" (I) <ul><li>Bus Invalidate Transaction</li></ul> The cache is set "Invalid" (I) <ul><li>Operations</li></ul> – <i>Write Allocate</i> – <i>Intervention</i>: from M – E (*) – <i>Write Invalidate</i> – <i>Copy-Back</i>: M replacement (*) – extended MESI <h3>MOESI protocol</h3> <p> States MEOSI = D-R-SD-V-I = T-MESI IBM<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a> </p> – Use of bus "shared line" to detect "shared" copy on the other caches <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> – If there is a M or O or E (*) copy in another cache the data is supplied by this cache (intervention). The requesting cache is set S, M is changed to O and E to S – else the data is read from MM. – If "shared line" is "on" the requesting cache is set S else E <ul><li>Write Hit</li></ul> – If the cache is M or E (exclusiveness), the write can take place locally without any other action – else O or S (sharing) an "Invalidation" transaction is sent on the bus to invalidate all the other caches. – The cache is set (or remains) M <ul><li>Write Miss</li></ul> – A RWITM operation is sent to the bus – Data is supplied from the "owner" or from MM as with Read Miss, then cache is written (updated) – The cache is set M and all the other caches are set I <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> – If the cache is M or O or E (*) the data is sent to requesting cache (intervention). If the cache is E the state is changed in S, else is set (or remains) O – else the state is changed or remains in S <ul><li>Bus Read – (RWITM)</li></ul> – If the cache is M or O or E (*) the data is sent to the bus (Intervention) – The cache is set "Invalid" (I) <ul><li>Bus Invalidate Transaction</li></ul> – The cache is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from M-O-E (*)</li> <li><i>Write Invalidate</i></li> <li><i>Copy-Back</i>: M-O replacement</li></ul> – (*) implementation depending for E <h3>Illinois protocol</h3> <p> States MESI = D-R-V-I<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a> </p> – Characteristics: – It is an extension of MESI protocol – Use of a network priority for shared intervention (intervention on shared data) – Differences from MESI: in addition to E and M, intervention also from S (see Read Miss – point 1) <ul><li>Operations</li></ul> - <i>Write Allocate</i> - <i>Intervention</i>: from M-E-S - <i>Write Invalidate</i> - <i>Copy-Back</i>: M replacement <h3>Write-once (or write-first) protocol</h3> <p> States D-R-V-I (MESI) <a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a><a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a><a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a> </p> – Characteristics: – No use of "shared line" (protocol for standard or unmodifiable bus) – Write Through on first Write Hit in state V, then Copy Back <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> – If there is a D copy in another cache, the data is supplied by this cache (intervention) and in the same time it is written also in MM (Copy-Back). – else the data is read from MM – all caches are set V <ul><li>Write Hit</li></ul> – If the cache is D or R (exclusiveness), the write can take place locally without any other action and the state is set (or remains) D – else V (first Write Hit) the data is written in cache and in MM (Write Through) invalidating all the other caches (Write-Invalidate). – The cache is set R <ul><li>Write Miss</li></ul> – Like a Read Miss but with "invalidate" command (RWITM) plus a Write Hit in D state (updating). The cache is set D and all the other caches are set "Invalid" (I) – Note – Write Through is performed only in "Write Miss". It is point out that in this case a bus transaction in any case is needed to invalidate the other caches and therefore it can be taken advantage of this fact to update also the MM. In "Write Hit" instead no more transaction is needed so a "Write Through" it would become a useless operation in case that the cache were updated again. <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> – If the cache is D the data is sent to requesting cache (intervention) and to MM (copy-back). The cache is set V – else the state is changed or remains in V <ul><li>Bus Read – (RWITM)</li></ul> – If the cache is D the data is sent to the bus (Intervention) – The cache is set "Invalid" (I) <ul><li>Bus Invalidate Transaction</li></ul> – The cache is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from D</li> <li><i>Write Through</i>: first write hit in V state</li> <li><i>Write Invalidate</i></li> <li><i>Copy-Back</i>: D replacement</li></ul> <h3>Bull HN ISI protocol</h3> <p>(Bull-Honeywell Italia) </p><p> States D-SD-R-V-I (MOESI) Patented protocol (F. Zulian)<a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a> </p> – Characteristics: – MOESI extension of the Write-Once protocol - Write-no-allocate on miss with D or SD updating - No use of RWITM - No use of "shared line" <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> - Like with MOESI with "Shared Line" "on" and intervention only from the "owner" D or SD but not from R <ul><li>Write Hit</li></ul> - If the cache is D or R, like with MOESI, the write can take place locally without any other action. The cache is set (or remains) D - If SD or V (first write), like with Write-Once, the data is written in cache and in MM (Write Through) invalidating all the other caches (Write-Invalidate) – The cache is set R - Write Miss - The data is sent to the bus bypassing the cache (Write-no-allocate) - If there is an "owner" copy D or SD, the "owner" is updated (see Write-no-Allocate – owner updating) while the other caches are invalidated. The "owner" is set (or remains) D. The memory remains "dirty" - else the data is sent to MM invalidating all the other caches (Write-Invalidate) <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> - Like with MOESI with intervention only from "owner" D or SD <ul><li>Bus Read (Write Update / Write Invalidate)</li></ul> - If the cache is D or SD, the cache is updated, else is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write-no-allocate</i>: on miss</li> <li><i>Write update</i>: on miss</li> <li><i>Write Through</i>: for the first write, then copy back</li> <li><i>Write Update / Write Invalidate</i></li> <li><i>Intervention</i>: from SD-D</li> <li><i>Copy-Back</i>: D replacement or SD replacement with invalidate</li></ul> Obs. - This is the only protocol that has O-E (SD-R) transactions and it is also the only one that makes use of the Write-no-allocated on miss. <h3>Synapse protocol</h3> <p> States D-V-I (MSI)<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a> </p> - Characteristics: - The characteristic of this protocol is ti have a single-bit tag with each cache line in MM, indicating that a cache have the line in D state. - This bit prevents a possible race condition if the D cache does not respond quickly enough to inhibit the MM from responding before being updating. - The data comes always from MM - No use of "shared line" <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> - If there is a D copy in another cache, the read transaction is rejected (no acknowledgement). The D copy is written back to MM and changes its state in V, then the requesting cache resends a new read transaction and the data is read from MM. - else the data is read from MM. - The cache is set V <ul><li>Write Hit</li></ul> - If the cache is D, the write can take place locally without any other action. - else V, like with Read Miss does, including a data transfer from memory with in addition an invalidate command (RWITM). This is done only to invalidate the other V copies because this protocol does not support an invalidation transaction. - The cache is set D. All the other caches copy are set "Invalid" (I) <ul><li>Write Miss (RWITM)</li></ul> - Like with Read Miss, but with invalidate command. The cache line comes from MM, then the cache is written (updated). The cache is set D. All the other caches are set "Invalid" (I). <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> - If the cache is D, the data is sent to MM (Copy Back). The cache is set V - else the state remains in V <ul><li>Bus Read (RWITM)</li></ul> - If the cache is D the data is sent to MM (Copy Back) - The cache (D or V) is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: no intervention</li> <li><i>Write Invalidate</i>: (RWITM)</li> <li><i>No Invalidate transaction</i></li> <li><i>Copy-Back</i>: D replacement</li></ul> <h3>Berkeley protocol</h3> <p> States D-SD-V-I (MOSI)<a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a> </p> - Characteristics: - As with MOESI without E state - No use of "shared line" <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> - The data is supplied by the "owner", that is from D or from SD else from MM. D is changed in SD - The cache is set V <ul><li>Write Hit</li></ul> - If the cache is D (exclusiveness), the write can take place locally without any other action - else (SD or V), an "Invalidation" transaction is sent on the bus to invalidate the other caches. - The cache is set (or remains) D <ul><li>Write Miss</li></ul> - RWITM operation is sent to the bus - Like with Read Miss, the data comes from the "owner", D or SD or from MM, then the cache is updated - The cache is set D. all the other caches are set I <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> - If the cache is D or SD the data is sent to requesting cache (intervention). The cache is set (or remains) in SD - else the cache remains in V <ul><li>Bus Read – (RWITM)</li></ul> - If the cache is D or SD the data is sent to the bus (Intervention) - The cache is set "Invalid" (I) <ul><li>Bus Invalidate Transaction</li></ul> - The cache is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from D-SD</li> <li><i>Write Invalidate</i></li> <li><i>Copy-Back</i>: D-SD replacement</li></ul> <h3>Firefly (DEC) protocol</h3> <p> States D-VE-S (MES)<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a> </p> - Characteristics: - No "Invalid" state - "Write-broadcasting"+"Write Through" - Use of "shared line" - "Write-broadcasting" avoid the necessity of "Invalid" state - Simultaneous intervention from all caches (shared and dirty intervention – on not modified that modified data) - This protocol requires a synchronous bus <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> - Any other cache is the "owner", that is all the other caches with a copy supplied simultaneously the date on the bus (simultaneous intervention – the bus timing is fixed so that they all respond in the same cycle), otherwise the data is supplied from MM. - If there is a cache D, the data is sent simultaneously also to MM (Copy Back) - If there are copies in the other caches, the "Shared line" is set "on" - If "Shared line" is "on" all the caches are set S else the requesting cache is set VE. <ul><li>Write Hit</li></ul> - If the cache is D or VE (exclusiveness), the write can take place locally without any other action and the cache is set D - else S, a "Write-broadcasting" is sent to the bus to update all the other caches and the MM (Write Through) - If there is a copy in another cache, the "Shared line" is set "on". If "Shared line" is set "off" the cache is set VE else all caches are set S <ul><li>Write Miss</li></ul> - The operation is made in two steps. Read Miss then Write Hit. - If the data comes from a cache (Shared Line "on") a "Write-broadcasting" is sent to the bus to update all the other caches and the MM (Write Through). All the caches are set S - else the cache is set D <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> - If hit (D or VE or S) the data is sent to the bus (intervention) and in case of D the data is written also in MM. The cache is set S <ul><li>Bus Read</li></ul> - If hit (D or VE or S) the data is sent to the bus (Intervention). - All the caches are set S <ul><li>Write Broadcasting</li></ul> - The cache is updated with new data. The state remains S <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from D-VE-S (from all "valid" caches)</li> <li><i>Write-broadcasting – Write through</i></li> <li><i>Copy-Back</i>: D replacement and on any transaction with a cache D</li></ul> <h3>Dragon (Xerox) protocol</h3> <p> States D-SD-VE-SC (MOES)<a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a> </p><p>Note – the state SC, despite the term "clean", can be "clean" or "dirty" as the S state of the other protocols. SC and S are equivalents </p> - Characteristics: - No "Invalid" state - "Write-broadcasting" (no "Write Through") - Use of "shared line" - "Write-broadcasting" avoid the necessity of "Invalid" state <ul><li>Processor operations</li></ul> <ul><li>Read Miss</li></ul> - The data is supplied by the "owner", that is from D or from SD else from MM. D is changed in SD - If "shared line" is "on" the cache is set SC else VE <ul><li>Write Hit</li></ul> - If the cache is D or VE (exclusiveness), the write can take place locally without any other action. The cache is set (or remains) D - else SD or SC (sharing) the data is written in cache and a "Write-broadcasting" is sent to the bus to update all the other caches – The MM is not updated (no Write through) - If there is a copy in another cache, the "Shared line" is set "on" - If the "Shared Line" is "on" the cache is set SD, else D. All the other caches possible copy are set SC <ul><li>Write Miss</li></ul> - Like with Read Miss, the data comes from the "owner", D or SD or from MM, then the cache is updated - If there is a copy in another cache, the "Shared line" is set "on". - If the "Shared Line" is "on" the updated data is broadcast to the other caches and the state is set SD. All the other caches are set SC - else the cache is D <ul><li>Bus transactions</li></ul> - Bus Read - If the cache is D or SD the data is sent to requesting cache (intervention). The cache is set (or remains) SD - else the cache remains SC <ul><li>Bus Read</li></ul> - If the cache is D or SD the data is sent to the bus (Intervention) - The cache is set SC <ul><li>Write Broadcasting</li></ul> - The cache is updated with new data. The cache remains SC <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from D-SD (but not from VE)</li> <li><i>Write-broadcasting</i></li> <li><i>Copy-Back</i>: D-SD replacement</li></ul> <h3>MERSI (IBM) / MESIF (Intel) protocol</h3> <p> States MERSI or R-MESI States MESIF Patented protocols – IBM (1997)<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a> – Intel (2002)<a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a> </p> - MERSI and MESIF are the same identical protocol (only the name state is different ,F instead of R) - Characteristics: - The same functionality of Illinois protocol - A new state R (Recent) / F (Forward) is the "<i>owner</i> " for "shared-clean" data (with MM updated). - The "shared ownership" (on clean data) is not assigned by a network priority like with Illinois, but it is always assigned to the last cache with Read Miss, setting its state R/F - The "ownership" is temporary loosed in case of R/F replacement. The "ownership" is reassigned again to the next Read Miss with caches "shared clean" - Use of the "shared line" <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from M-E-R/F</li> <li><i>Write Invalidate</i></li> <li><i>Copy-Back</i>: M replacement</li></ul> <h3>MESI vs MOESI</h3> <p>MESI and MOESI are the most popular protocols </p><p>It is common opinion that MOESI is an extension of MESI protocol and therefore it is more sophisticate and more performant. This is true only if compared with standard MESI, that is MESI with "not sharing intervention". MESI with "sharing intervention", as <i>MESI Illinois like or the equivalent 5-state protocols MERSI / MESIF, are much more performant than the MOESI protocol</i>. </p><p>In MOESI, cache-to-cache operations is made only on modified data. Instead in MESI Illinois type and MERSI / MESIF protocols, the cache-to-cache operations are always performed both with clean that with modified data. In case of modified data, the intervention is made by the "owner" M, but the ownership is not loosed because it is migrated in another cache (R/F cache in MERSI / MESIF or a selected cache as Illinois type). The only difference is that the MM must be updated. But also in MOESI this transaction should be done later in case of replacement, if no other modification occurs meanwhile. However this it is a smaller limit compared to the memory transactions due to the not-intervention, as in case of clean data for MOESI protocol. (see e.g. "Performance evaluation between MOESI (Shanghai) and MESIF Nehalem-EP"<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a>) </p><p>The most advance systems use only R-MESI / MESIF protocol or the more complete RT-MESI, HRT-ST-MESI and POWER4 IBM protocols that are an enhanced merging of MESI and MOESI protocols </p><p>Note: Cache-to-cache is an efficient approach in multiprocessor/multicore systems direct connected between them, but less in Remote cache as in NUMA systems where a standard MESI is preferable. Example in POWER4 IBM protocol "shared intervention" is made only "local" and not between remote module. </p> <h3>RT-MESI protocol</h3> <p> States RT-MESI IBM patented protocol<a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a><a class="footnote-ref" id="fnref:70" href="#fn:70"><sup>70</sup></a> </p> <ul><li>Characteristics:</li></ul> - MESI and MOESI merging - Shared Intervention + Dirty Intervention (both on clean and dirty data) - Same functionality of R-MESI protocol with a new state T=Tagged, equivalent to O state - "Dirty-Owner" migration - The "owner" (both Shared or Dirty) is always the last requesting cache (the new "owner" (<a href="/facts/Least_Recently_Used/LFW5UqPo">LRU</a>) has less probability to be deallocated soon compared to the old one) - The "owners" are T, M, E, R (all except S) - Use of the "shared line" <p>Processor operations </p> <ul><li>Read Miss</li></ul> - If there is a M or T (dirty-ownership) copy in another cache, the data is supplied by this cache (dirty intervention). The requesting cache is set T and the previous M or T are changed in S - If there is a E or R (shared-ownership) copy in another cache, the data is supplied by this cache (shared intervention). The requesting data is set R and E or R are changed in S - else the data is read from MM and the cache is set R. <ul><li>Write Hit</li></ul> - If the cache is M or E (exclusiveness), the write can take place locally without any other action - else T or R or S (sharing) an "Invalidation" transaction is sent on the bus to invalidate all the other caches. - The cache is set (or remains) M and all the other caches are set I <ul><li>Write Miss</li></ul> - RWITM operation is sent to the bus - Data is supplied from the "owner" or from the MM as with Read Miss, then the data is written (updated) in cache. - The cache is set M and all the other caches are set I <ul><li>Bus transactions</li></ul> <ul><li>Bus Read</li></ul> - If the cache is T or M or R or E the data is sent to requesting cache (intervention). - The cache is set (or remains) in S <ul><li>Bus Read – (RWITM)</li></ul> - If the cache is T or M or R or E the data is sent to requesting cache (intervention) - The cache is set "Invalid" (I) <ul><li>Bus Invalidate Transaction</li></ul> - The cache is set "Invalid" (I) <ul><li>Operations</li> <li><i>Write Allocate</i></li> <li><i>Intervention</i>: from T-M-R-E</li> <li><i>Write Invalidate</i></li> <li><i>Copy-Back</i>: T-M replacement</li></ul> <h3>RT-ST-MESI protocol</h3> <p>It is an improvement of RT-MESI protocol<a class="footnote-ref" id="fnref:71" href="#fn:71"><sup>71</sup></a> and it is a subset of HRT-ST-MESI protocol<a class="footnote-ref" id="fnref:72" href="#fn:72"><sup>72</sup></a> </p> ST = Shared-Tagged - Use of the "Shared-Tagged" state allows to maintain intervention after deallocation of a Tagged cache line - In case of T replacement (cache line deallocation), the data needs to be written back to MM and so to lose the "ownership". To avoid this, a new state ST can be used. In Read Miss the previous T is set ST instead of S. ST is the candidate to replace the ownership in case of T deallocation. The T "Copy back" transaction is stopped (no MM updating) by the ST cache that changes its state in T. In case of a new read from another cache, this last is set T, the previous T is changed in ST and the previous ST is changed in S. <p>An additional improvement can be obtained using more than a ST state, ST1, ST2, … STn. </p> - In Read Miss, T is changed in ST1 and all the indices of the others STi are increased by "1. - In case of T deallocation, ST1 stops the "Copy Back" transaction, changes its state in T and all the indices of the others STi are decrease by "1". - In case of a deallocation, for instance STk, the chain will be interrupted and all the STi with index greater of "k" are automatically loosen in term of ST and will be considered <i>de facto</i> only as simple S states also if they are set as ST. All this because only ST1 intervenes to block and to replace itself with T. For instance if we have a situation type T, ST1, ST3, ST4 with ST2 replaced, if T will be replaced the new situation will be T, ST2, ST3 without any ST1. <h3>HRT-ST-MESI protocol</h3> <p>IBM patented full HRT-ST-MESI protocol<a class="footnote-ref" id="fnref:73" href="#fn:73"><sup>73</sup></a><a class="footnote-ref" id="fnref:74" href="#fn:74"><sup>74</sup></a> </p><p>- I state = Invalid Tag (*) – Invalid Data - H state = Valid Tag – Invalid Data </p><p>- I state is set at the cache initialization and its state changes only after a processor Read or Write miss. After it will not return more in this state. </p><p>- H has the same functionality of I state but in addition with the ability to capture any bus transaction that match the Tag of the directory and to update the data cache. </p><p>- After the first utilization I is replaced by H in its functions </p> - The main features are : - Write Back - Intervention both in sharing-clean and dirty data – from T-M-R-E - Reserve states of the Tagged (Shared-Tagged) - Invalid H state (Hover) auto-updating <p>(*) – Note: The Tag for definition is always valid, but until the first updating of the cache line it is considered invalid in order to avoid to update the cache also when this line has been not still required and used. </p> <h3>POWER4 IBM protocol</h3> <p> States M-T-Me-S-I -Mu-SL = RT-MESI+Mu<a class="footnote-ref" id="fnref:75" href="#fn:75"><sup>75</sup></a> </p> - Use of the "shared line" <ul><li>Used in multi-core/module systems – multi L2 cache <a class="footnote-ref" id="fnref:76" href="#fn:76"><sup>76</sup></a></li> <li>This protocol is equivalent to the RT-MESI protocol for system with multi L2 cache on multi-module systems</li></ul> <ul><li>SL - "Shared Last" equivalent to R on RT-MESI</li> <li>Me - "Valid Exclusive" = E</li> <li>Mu – unsolicited modified state</li></ul> - special state – asking for a reservation for load and store doubleword (for 64-bit implementations) <ul><li>"Shared intervention" from SL is done only between L2 caches of the same module</li> <li>"Dirty intervention" from T is done only between L2 caches of the same module</li> <li>Operations</li></ul> - <i>Write Allocate</i> - <i>Intervention</i>: from M-T-VE-SL = M-O-E-SL - <i>Write Invalidate</i> - <i>Copy-Back</i>: M-T replacement - Note : T and SL – Intervention only on the locale module <h2 id="general-considerations-on-the-protocols">General considerations on the protocols</h2> <p>Under some conditions the most efficient and complete protocol turns out to be the HRT-ST-MESI protocol. </p> - Write Back - Intervention both with dirty than shared-clean data - Reserve states of the Tagged state (Shared-Tagged) - Invalid H (Hover) state auto-updating <h2 id="references">References</h2> <ol> <li id="fn:1"><p>US patent 5701413, "Multi-processor system with shared memory" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5701413" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5701413</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>EP patent 0923032A1, "Method for transferring data in a multiprocessor computer system with crossbar interconnecting unit" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0923032A1" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0923032A1</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>"Specification and Verification of the PowerScale Bus Arbitration Protocol: An Industrial Experiment with LOTOS, Chap. 2, Pag. 4" (PDF). <a href="ftp://ftp.inrialpes.fr/pub/vasy/publications/cadp/Chehaibar-Garavel-et-al-96.pdf" target="_blank">ftp://ftp.inrialpes.fr/pub/vasy/publications/cadp/Chehaibar-Garavel-et-al-96.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>""MPC7400 RISC Microprocessor User's Manual"" (PDF). <a href="http://pccomponents.com/datasheets/MOT-MPC7400.PDF" target="_blank">http://pccomponents.com/datasheets/MOT-MPC7400.PDF</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>""An Introduction to the Intel® QuickPath Interconnect"" (PDF). <a href="http://www.intel.ie/content/dam/doc/white-paper/quick-path-interconnect-introduction-paper.pdf" target="_blank">http://www.intel.ie/content/dam/doc/white-paper/quick-path-interconnect-introduction-paper.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>US Patent 6922756, "Forward state for use in cache coherency in a multiprocessor system" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6922756" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6922756</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"POWER4 System Microarchitecture" (PDF). cc.gatech.edu. 2008-10-08. Archived from the original (PDF) on 2013-11-07. <a href="https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf" target="_blank">https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"IBM PowerPC 476FP L2 Cache Core Databook" <a href="https://www-01.ibm.com/chips/techlib/techlib.nsf/techdocs/8D5342097498C81A852575C50078D867/$file/L2CacheController_v1.5_ext_Pub.pdf" target="_blank">https://www-01.ibm.com/chips/techlib/techlib.nsf/techdocs/8D5342097498C81A852575C50078D867/$file/L2CacheController_v1.5_ext_Pub.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>""MPC750UM/D 12/2001 Rev. 1 MPC750 RISC Microprocessor Family User's Manual"" (PDF). <a href="http://www.freescale.com/files/32bit/doc/ref_manual/MPC750UM.pdf" target="_blank">http://www.freescale.com/files/32bit/doc/ref_manual/MPC750UM.pdf</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Shanley, T. (1998). Pentium Pro and Pentium II System Architecture. Mindshare PC System Architecture Series. Addison-Wesley. p. 160. ISBN 978-0-201-30973-7. <a href="978-0-201-30973-7" target="_blank">978-0-201-30973-7</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>AMD64 Architecture Programmer's Manual. Vol. 2: System Programming. AMD. May 2013 – via Internet Archive. <a href="https://archive.org/details/24593APMV21" target="_blank">https://archive.org/details/24593APMV21</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Sweazey, P.; Smith, A. J. (1986). "A class of compatible cache consistency protocols and their support by the IEEE futurebus" (PDF). ACM SIGARCH Computer Architecture News. 14 (2). Association for Computing Machinery (ACM): 414–423. doi:10.1145/17356.17404. ISSN 0163-5964. S2CID 9713683. <a href="http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf" target="_blank">http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Papamarcos, Mark S.; Patel, Janak H. (1984). "A low-overhead coherence solution for multiprocessors with private cache memories". Proceedings of the 11th annual international symposium on Computer architecture - ISCA '84. New York, New York, USA: ACM Press. pp. 348–354. doi:10.1145/800015.808204. ISBN 0818605383. <a href="0818605383" target="_blank">0818605383</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Goodman, James R. (1983). "Using cache memory to reduce processor-memory traffic" (PDF). Proceedings of the 10th annual international symposium on Computer architecture - ISCA '83. New York, New York, USA: ACM Press. pp. 124–131. doi:10.1145/800046.801647. ISBN 0897911016. <a href="0897911016" target="_blank">0897911016</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Hwang, K. (2011). Advanced Computer Architecture, 2E. McGraw-Hill computer science series. McGraw Hill Education. p. 301. ISBN 978-0-07-070210-3. <a href="978-0-07-070210-3" target="_blank">978-0-07-070210-3</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>EP patent 0396940B1, Ferruccio Zulian, "Cache memory and related consistency protocol" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>""MPC7400 RISC Microprocessor User's Manual"" (PDF). <a href="http://pccomponents.com/datasheets/MOT-MPC7400.PDF" target="_blank">http://pccomponents.com/datasheets/MOT-MPC7400.PDF</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>""An Introduction to the Intel® QuickPath Interconnect"" (PDF). <a href="http://www.intel.ie/content/dam/doc/white-paper/quick-path-interconnect-introduction-paper.pdf" target="_blank">http://www.intel.ie/content/dam/doc/white-paper/quick-path-interconnect-introduction-paper.pdf</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Hackenberg, Daniel; Molka, Daniel; Nagel, Wolfgang E. (2009-12-12). "Comparing cache architectures and coherency protocols on x86-64 multicore SMP systems" (PDF). Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture. New York, NY, USA: ACM. pp. 413–422. doi:10.1145/1669112.1669165. ISBN 9781605587981. <a href="9781605587981" target="_blank">9781605587981</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>Rolf, Trent (2009), Cache Organization and Memory Management of the Intel Nehalem Computer Architecture (PDF) <a href="http://gec.di.uminho.pt/Discip/MInf/cpd1011/PAC/material/nehalemPaper.pdf" target="_blank">http://gec.di.uminho.pt/Discip/MInf/cpd1011/PAC/material/nehalemPaper.pdf</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>David Kanter (2007-08-28), "The Common System Interface: Intel's Future Interconnect", Real World Tech: 5, retrieved 2012-08-12 <a href="http://www.realworldtech.com/common-system-interface/5/" target="_blank">http://www.realworldtech.com/common-system-interface/5/</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>"POWER4 System Microarchitecture" (PDF). cc.gatech.edu. 2008-10-08. Archived from the original (PDF) on 2013-11-07. <a href="https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf" target="_blank">https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>EP patent 0396940B1, Ferruccio Zulian, "Cache memory and related consistency protocol" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>Sweazey, P.; Smith, A. J. (1986). "A class of compatible cache consistency protocols and their support by the IEEE futurebus" (PDF). ACM SIGARCH Computer Architecture News. 14 (2). Association for Computing Machinery (ACM): 414–423. doi:10.1145/17356.17404. ISSN 0163-5964. S2CID 9713683. <a href="http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf" target="_blank">http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>Rolf, Trent (2009), Cache Organization and Memory Management of the Intel Nehalem Computer Architecture (PDF) <a href="http://gec.di.uminho.pt/Discip/MInf/cpd1011/PAC/material/nehalemPaper.pdf" target="_blank">http://gec.di.uminho.pt/Discip/MInf/cpd1011/PAC/material/nehalemPaper.pdf</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>Sweazey, P.; Smith, A. J. (1986). "A class of compatible cache consistency protocols and their support by the IEEE futurebus" (PDF). ACM SIGARCH Computer Architecture News. 14 (2). Association for Computing Machinery (ACM): 414–423. doi:10.1145/17356.17404. ISSN 0163-5964. S2CID 9713683. <a href="http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf" target="_blank">http://pdf.aminer.org/000/419/524/a_class_of_compatible_cache_consistency_protocols_and_their_support.pdf</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>EP patent 0396940B1, Ferruccio Zulian, "Cache memory and related consistency protocol" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>Shanley, T. (1998). Pentium Pro and Pentium II System Architecture. Mindshare PC System Architecture Series. Addison-Wesley. p. 160. ISBN 978-0-201-30973-7. <a href="978-0-201-30973-7" target="_blank">978-0-201-30973-7</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>Shanley, T. (1998). Pentium Pro and Pentium II System Architecture. Mindshare PC System Architecture Series. Addison-Wesley. p. 160. ISBN 978-0-201-30973-7. <a href="978-0-201-30973-7" target="_blank">978-0-201-30973-7</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>"Optimizing the MESI Cache Coherence Protocol for Multithreaded Applications on Small Symmetric Multiprocessor Systems". Neal Tibrewala's Resume. 2003-12-12. Archived from the original on 2016-10-22. <a href="http://tibrewala.net/papers/mesi98/" target="_blank">http://tibrewala.net/papers/mesi98/</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>Shanley, T. (1998). Pentium Pro and Pentium II System Architecture. Mindshare PC System Architecture Series. Addison-Wesley. p. 160. ISBN 978-0-201-30973-7. <a href="978-0-201-30973-7" target="_blank">978-0-201-30973-7</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>Goodman, James R. (1983). "Using cache memory to reduce processor-memory traffic" (PDF). Proceedings of the 10th annual international symposium on Computer architecture - ISCA '83. New York, New York, USA: ACM Press. pp. 124–131. doi:10.1145/800046.801647. ISBN 0897911016. <a href="0897911016" target="_blank">0897911016</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>Hwang, K. (2011). Advanced Computer Architecture, 2E. McGraw-Hill computer science series. McGraw Hill Education. p. 301. ISBN 978-0-07-070210-3. <a href="978-0-07-070210-3" target="_blank">978-0-07-070210-3</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>EP patent 0396940B1, Ferruccio Zulian, "Cache memory and related consistency protocol" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=EP0396940B1</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>, Archibald, James; Baer, Jean-Loup (1986). "Cache coherence protocols: evaluation using a multiprocessor simulation model" (PDF). ACM Transactions on Computer Systems. 4 (4). Association for Computing Machinery (ACM): 273–298. doi:10.1145/6513.6514. ISSN 0734-2071. S2CID 713808. <a href="http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf" target="_blank">http://ctho.org/toread/forclass/18-742/3/p273-archibald.pdf</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>US Patent 5996049, "Cache-coherency protocol with recently read state for data and instructions" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5996049</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>US Patent 6922756, "Forward state for use in cache coherency in a multiprocessor system" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6922756" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6922756</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>Hackenberg, Daniel; Molka, Daniel; Nagel, Wolfgang E. (2009-12-12). "Comparing cache architectures and coherency protocols on x86-64 multicore SMP systems" (PDF). Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture. New York, NY, USA: ACM. pp. 413–422. doi:10.1145/1669112.1669165. ISBN 9781605587981. <a href="9781605587981" target="_blank">9781605587981</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> <li id="fn:70"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></p></li> <li id="fn:71"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></p></li> <li id="fn:72"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></p></li> <li id="fn:73"><p>US Patent 6275908, "Cache Coherency Protocol Including an HR State" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6275908</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></p></li> <li id="fn:74"><p>US Patent 6334172, "Cache Coherency Protocol with Tagged State for Modified Values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US6334172</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></p></li> <li id="fn:75"><p>"POWER4 System Microarchitecture" (PDF). cc.gatech.edu. 2008-10-08. Archived from the original (PDF) on 2013-11-07. <a href="https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf" target="_blank">https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></p></li> <li id="fn:76"><p>"POWER4 System Microarchitecture" (PDF). cc.gatech.edu. 2008-10-08. Archived from the original (PDF) on 2013-11-07. <a href="https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf" target="_blank">https://web.archive.org/web/20131107140531/http://www.cc.gatech.edu/~bader/COURSES/UNM/ece637-Fall2003/papers/TDF02.pdf</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></p></li> </ol>