L1 and Ln cache: when are they written?Why can L3 caches hold only shared blocks?Multi-level cache for which inclusion holdsMESI Protocol Invalid cache line is attempted to be stored?Back invalidation to maintain inclusion in inclusive cacheComputer Architecture, cache hit and missesWhat if block sizes are not equal among caches?Pros and Cons of Average Memory Access Time When Increasing Cache Block SizeDirect-mapping cache questionCalculate Miss rate of L2 cache given global and L1 miss ratesSet Associative Cache Exercises

What should you do if you miss a job interview (deliberately)?

Is it possible to have a strip of cold climate in the middle of a planet?

Are the IPv6 address space and IPv4 address space completely disjoint?

Multiplicative persistence

Count the occurrence of each unique word in the file

Strong empirical falsification of quantum mechanics based on vacuum energy density

2.8 Why are collections grayed out? How can I open them?

Can Legal Documents Be Siged In Non-Standard Pen Colors?

What is this called? Old film camera viewer?

What does chmod -u do?

What was this official D&D 3.5e Lovecraft-flavored rulebook?

Problem with TransformedDistribution

Is the U.S. Code copyrighted by the Government?

Is aluminum electrical wire used on aircraft?

Can I sign legal documents with a smiley face?

How to implement a feedback to keep the DC gain at zero for this conceptual passive filter?

Freedom of speech and where it applies

L1 and Ln cache: when are they written?

Store Credit Card Information in Password Manager?

What are the purposes of autoencoders?

Pre-modern battle - command it, or fight in it?

How did Rebekah know that Esau was planning to kill his brother in Genesis 27:42?

What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?

Why should universal income be universal?



L1 and Ln cache: when are they written?


Why can L3 caches hold only shared blocks?Multi-level cache for which inclusion holdsMESI Protocol Invalid cache line is attempted to be stored?Back invalidation to maintain inclusion in inclusive cacheComputer Architecture, cache hit and missesWhat if block sizes are not equal among caches?Pros and Cons of Average Memory Access Time When Increasing Cache Block SizeDirect-mapping cache questionCalculate Miss rate of L2 cache given global and L1 miss ratesSet Associative Cache Exercises













1












$begingroup$


I have been following the "High Performance Computer Architecture" course from Georgia Tech (also on YouTube), and unless I've missed something, I cannot see where the following has been explained:



If I have a multilevel cache, L1/L2/L3/Ln:



1) what decides what level of this hierarchy a block fetched from memory initially gets put in?



2) If I evict a block from L1, does that mean it gets moved to L2 (replacing a block from L2 depending on the replacement policy), and so forth for L2 to L3, and L3 to Ln, until the block evicted from the last level cache gets written to memory?



PS And yes, I have searched for this, so don't downvote assuming I haven't :)



Update



After the answer given below, I went back to the video course and found this. It seems to suggest that data is initially fetched into the L2 cache, then "fed" to the L1 cache. This also shows how, without the inclusion bit set, L1 and L2 can become "out of sync".



3) Is this generally what happens in all caches? IE if I have a 7 layer cache, will the block be fetched into L7, then fed L7->L6, L6->L5 ... and finally L2->L1? This seems like a lot of work...



4) Except in the situation shown in the linked video (if the caches get "out of sync" then certain data will only be available in one cache even though it started out in both caches), it seems that having the same data in multiple levels of the cache all the time (i.e. when the inclusion bit is set) is a waste; we have to copy it amongst all the levels. This can't be the case though, so what am I missing?










share|cite|improve this question









New contributor




Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$
















    1












    $begingroup$


    I have been following the "High Performance Computer Architecture" course from Georgia Tech (also on YouTube), and unless I've missed something, I cannot see where the following has been explained:



    If I have a multilevel cache, L1/L2/L3/Ln:



    1) what decides what level of this hierarchy a block fetched from memory initially gets put in?



    2) If I evict a block from L1, does that mean it gets moved to L2 (replacing a block from L2 depending on the replacement policy), and so forth for L2 to L3, and L3 to Ln, until the block evicted from the last level cache gets written to memory?



    PS And yes, I have searched for this, so don't downvote assuming I haven't :)



    Update



    After the answer given below, I went back to the video course and found this. It seems to suggest that data is initially fetched into the L2 cache, then "fed" to the L1 cache. This also shows how, without the inclusion bit set, L1 and L2 can become "out of sync".



    3) Is this generally what happens in all caches? IE if I have a 7 layer cache, will the block be fetched into L7, then fed L7->L6, L6->L5 ... and finally L2->L1? This seems like a lot of work...



    4) Except in the situation shown in the linked video (if the caches get "out of sync" then certain data will only be available in one cache even though it started out in both caches), it seems that having the same data in multiple levels of the cache all the time (i.e. when the inclusion bit is set) is a waste; we have to copy it amongst all the levels. This can't be the case though, so what am I missing?










    share|cite|improve this question









    New contributor




    Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$














      1












      1








      1





      $begingroup$


      I have been following the "High Performance Computer Architecture" course from Georgia Tech (also on YouTube), and unless I've missed something, I cannot see where the following has been explained:



      If I have a multilevel cache, L1/L2/L3/Ln:



      1) what decides what level of this hierarchy a block fetched from memory initially gets put in?



      2) If I evict a block from L1, does that mean it gets moved to L2 (replacing a block from L2 depending on the replacement policy), and so forth for L2 to L3, and L3 to Ln, until the block evicted from the last level cache gets written to memory?



      PS And yes, I have searched for this, so don't downvote assuming I haven't :)



      Update



      After the answer given below, I went back to the video course and found this. It seems to suggest that data is initially fetched into the L2 cache, then "fed" to the L1 cache. This also shows how, without the inclusion bit set, L1 and L2 can become "out of sync".



      3) Is this generally what happens in all caches? IE if I have a 7 layer cache, will the block be fetched into L7, then fed L7->L6, L6->L5 ... and finally L2->L1? This seems like a lot of work...



      4) Except in the situation shown in the linked video (if the caches get "out of sync" then certain data will only be available in one cache even though it started out in both caches), it seems that having the same data in multiple levels of the cache all the time (i.e. when the inclusion bit is set) is a waste; we have to copy it amongst all the levels. This can't be the case though, so what am I missing?










      share|cite|improve this question









      New contributor




      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I have been following the "High Performance Computer Architecture" course from Georgia Tech (also on YouTube), and unless I've missed something, I cannot see where the following has been explained:



      If I have a multilevel cache, L1/L2/L3/Ln:



      1) what decides what level of this hierarchy a block fetched from memory initially gets put in?



      2) If I evict a block from L1, does that mean it gets moved to L2 (replacing a block from L2 depending on the replacement policy), and so forth for L2 to L3, and L3 to Ln, until the block evicted from the last level cache gets written to memory?



      PS And yes, I have searched for this, so don't downvote assuming I haven't :)



      Update



      After the answer given below, I went back to the video course and found this. It seems to suggest that data is initially fetched into the L2 cache, then "fed" to the L1 cache. This also shows how, without the inclusion bit set, L1 and L2 can become "out of sync".



      3) Is this generally what happens in all caches? IE if I have a 7 layer cache, will the block be fetched into L7, then fed L7->L6, L6->L5 ... and finally L2->L1? This seems like a lot of work...



      4) Except in the situation shown in the linked video (if the caches get "out of sync" then certain data will only be available in one cache even though it started out in both caches), it seems that having the same data in multiple levels of the cache all the time (i.e. when the inclusion bit is set) is a waste; we have to copy it amongst all the levels. This can't be the case though, so what am I missing?







      cpu-cache






      share|cite|improve this question









      New contributor




      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question









      New contributor




      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question








      edited 1 hour ago







      Wad













      New contributor




      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 5 hours ago









      WadWad

      1063




      1063




      New contributor




      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Wad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          1) Usually any accessed data are saved into L1, independent whether they were previously available in L1, L2... or memory only.



          For exclusive cache, data are stored ONLY in L1, for inclusive one, in the entire hierarchy. There are also mixed strategies. Also, some CPUs have "victim cache", which is extra cache level which gets ONLY data moved out of LLC (last level cache).



          2) Yes, for write-back exclusive cache.



          3) You misunderstood his explanation. He said that data are fetched and placed to both caches. Inclusion, btw, isn't the "bit set", but entire cache policy. The policy is built right into the hardware.



          4) Exclusive cache better use precious space, but each time you have to bring new block into L1, you have to displace some block to L2, then some one to L3... and finally some one to memory. This means a lot of work. With inclusive cache, you just drop data from L1 cache, or replace older copy in L2 with newer copy displaced from L1.



          As result, exclusive strategy is more optimal when adjacent cache levels has closer sizes (f.e. <=4x) and inclusive is better when sizes are very different.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad done......
            $endgroup$
            – Bulat
            1 hour ago










          • $begingroup$
            Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
            $endgroup$
            – Bulat
            49 mins ago










          • $begingroup$
            4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
            $endgroup$
            – Bulat
            42 mins ago










          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "419"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );






          Wad is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105949%2fl1-and-ln-cache-when-are-they-written%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          1) Usually any accessed data are saved into L1, independent whether they were previously available in L1, L2... or memory only.



          For exclusive cache, data are stored ONLY in L1, for inclusive one, in the entire hierarchy. There are also mixed strategies. Also, some CPUs have "victim cache", which is extra cache level which gets ONLY data moved out of LLC (last level cache).



          2) Yes, for write-back exclusive cache.



          3) You misunderstood his explanation. He said that data are fetched and placed to both caches. Inclusion, btw, isn't the "bit set", but entire cache policy. The policy is built right into the hardware.



          4) Exclusive cache better use precious space, but each time you have to bring new block into L1, you have to displace some block to L2, then some one to L3... and finally some one to memory. This means a lot of work. With inclusive cache, you just drop data from L1 cache, or replace older copy in L2 with newer copy displaced from L1.



          As result, exclusive strategy is more optimal when adjacent cache levels has closer sizes (f.e. <=4x) and inclusive is better when sizes are very different.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad done......
            $endgroup$
            – Bulat
            1 hour ago










          • $begingroup$
            Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
            $endgroup$
            – Bulat
            49 mins ago










          • $begingroup$
            4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
            $endgroup$
            – Bulat
            42 mins ago















          2












          $begingroup$

          1) Usually any accessed data are saved into L1, independent whether they were previously available in L1, L2... or memory only.



          For exclusive cache, data are stored ONLY in L1, for inclusive one, in the entire hierarchy. There are also mixed strategies. Also, some CPUs have "victim cache", which is extra cache level which gets ONLY data moved out of LLC (last level cache).



          2) Yes, for write-back exclusive cache.



          3) You misunderstood his explanation. He said that data are fetched and placed to both caches. Inclusion, btw, isn't the "bit set", but entire cache policy. The policy is built right into the hardware.



          4) Exclusive cache better use precious space, but each time you have to bring new block into L1, you have to displace some block to L2, then some one to L3... and finally some one to memory. This means a lot of work. With inclusive cache, you just drop data from L1 cache, or replace older copy in L2 with newer copy displaced from L1.



          As result, exclusive strategy is more optimal when adjacent cache levels has closer sizes (f.e. <=4x) and inclusive is better when sizes are very different.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad done......
            $endgroup$
            – Bulat
            1 hour ago










          • $begingroup$
            Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
            $endgroup$
            – Bulat
            49 mins ago










          • $begingroup$
            4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
            $endgroup$
            – Bulat
            42 mins ago













          2












          2








          2





          $begingroup$

          1) Usually any accessed data are saved into L1, independent whether they were previously available in L1, L2... or memory only.



          For exclusive cache, data are stored ONLY in L1, for inclusive one, in the entire hierarchy. There are also mixed strategies. Also, some CPUs have "victim cache", which is extra cache level which gets ONLY data moved out of LLC (last level cache).



          2) Yes, for write-back exclusive cache.



          3) You misunderstood his explanation. He said that data are fetched and placed to both caches. Inclusion, btw, isn't the "bit set", but entire cache policy. The policy is built right into the hardware.



          4) Exclusive cache better use precious space, but each time you have to bring new block into L1, you have to displace some block to L2, then some one to L3... and finally some one to memory. This means a lot of work. With inclusive cache, you just drop data from L1 cache, or replace older copy in L2 with newer copy displaced from L1.



          As result, exclusive strategy is more optimal when adjacent cache levels has closer sizes (f.e. <=4x) and inclusive is better when sizes are very different.






          share|cite|improve this answer











          $endgroup$



          1) Usually any accessed data are saved into L1, independent whether they were previously available in L1, L2... or memory only.



          For exclusive cache, data are stored ONLY in L1, for inclusive one, in the entire hierarchy. There are also mixed strategies. Also, some CPUs have "victim cache", which is extra cache level which gets ONLY data moved out of LLC (last level cache).



          2) Yes, for write-back exclusive cache.



          3) You misunderstood his explanation. He said that data are fetched and placed to both caches. Inclusion, btw, isn't the "bit set", but entire cache policy. The policy is built right into the hardware.



          4) Exclusive cache better use precious space, but each time you have to bring new block into L1, you have to displace some block to L2, then some one to L3... and finally some one to memory. This means a lot of work. With inclusive cache, you just drop data from L1 cache, or replace older copy in L2 with newer copy displaced from L1.



          As result, exclusive strategy is more optimal when adjacent cache levels has closer sizes (f.e. <=4x) and inclusive is better when sizes are very different.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited 1 hour ago

























          answered 4 hours ago









          BulatBulat

          796410




          796410











          • $begingroup$
            Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad done......
            $endgroup$
            – Bulat
            1 hour ago










          • $begingroup$
            Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
            $endgroup$
            – Bulat
            49 mins ago










          • $begingroup$
            4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
            $endgroup$
            – Bulat
            42 mins ago
















          • $begingroup$
            Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad done......
            $endgroup$
            – Bulat
            1 hour ago










          • $begingroup$
            Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
            $endgroup$
            – Wad
            1 hour ago










          • $begingroup$
            @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
            $endgroup$
            – Bulat
            49 mins ago










          • $begingroup$
            4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
            $endgroup$
            – Bulat
            42 mins ago















          $begingroup$
          Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
          $endgroup$
          – Wad
          1 hour ago




          $begingroup$
          Thanks for responding. I have updated the original question after reviewing your comment and using it to search the course I linked to: could you please check my update and update your answer? Thanks!
          $endgroup$
          – Wad
          1 hour ago












          $begingroup$
          @Wad done......
          $endgroup$
          – Bulat
          1 hour ago




          $begingroup$
          @Wad done......
          $endgroup$
          – Bulat
          1 hour ago












          $begingroup$
          Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
          $endgroup$
          – Wad
          1 hour ago




          $begingroup$
          Thank you for taking the time to edit your answer. I don't understand 3) and 4) however, sorry. 3) So in an N level cache, what level is written to first when we have a miss? Is it N? And if so, is that same block copied to all higher levels? 4) Regarding exclusive, why do you need to displace from L1 to L2? Is this what I questioned in 2) above that you answered? Inclusion: surely this involves the most work, copying a block across all N caches??
          $endgroup$
          – Wad
          1 hour ago












          $begingroup$
          @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
          $endgroup$
          – Bulat
          49 mins ago




          $begingroup$
          @Wad 3) Data are written into all cache levels simultaneously. It can be done since all hardware in the CPU can work simultaneously. Physically, it can be done earlier or later. What is really important for us is that data become available for following operations so next access to A will be done at L1 speed. (Of course, in exclusive cache data are written only into L1)
          $endgroup$
          – Bulat
          49 mins ago












          $begingroup$
          4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
          $endgroup$
          – Bulat
          42 mins ago




          $begingroup$
          4) In exclusive cache, when you displace data from L1, they absent in L2. So you should save them there for the case they will be used again (and it's the only way anything can be written to L2 when caches are exclusive)
          $endgroup$
          – Bulat
          42 mins ago










          Wad is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          Wad is a new contributor. Be nice, and check out our Code of Conduct.












          Wad is a new contributor. Be nice, and check out our Code of Conduct.











          Wad is a new contributor. Be nice, and check out our Code of Conduct.














          Thanks for contributing an answer to Computer Science Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105949%2fl1-and-ln-cache-when-are-they-written%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Saint-André (Pyrenaeus Orientalis) Nexus interni Nexus externi | Tabula navigationisOpenStreetMapGeoNames66168De hoc commune apud cassini.ehess.frHuius communis pagina interretialisAmplifica

          Constantinus Vanšenkin Nexus externi | Tabula navigationisБольшая российская энциклопедияAmplifica

          Montigny (Ligerula) Nexus interni Nexus externi | Tabula navigationisGeoNames45214Amplifica