Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>The first two cases you are exposing in your question are about the same. Things would really change in the following two cases:</p> <p>CASE 1:</p> <pre><code>for(int i = 0; i &lt; 10; i++) { for(int j = 0; j &lt; 1000; j++) { b[i] += a[i]*a[j]; } } </code></pre> <p>Here you are accessing the matrix "a" as follows: a[0]*a[0], a[0]*a<a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">1</a>, a[0]*a[2],.... In most architectures, matrix structures are stored in memory like: a[0]*a[0], a<a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">1</a>*a[0], a[2]*a[0] (first column of first row followed by second column of first raw,....). Imagine your cache only could store 5 elements and your matrix is 6x6. The first "pack" of elements that would be stored in cache would be a[0]*a[0] to a[4]*a[0]. Your first acces would cause no cache miss so a[0][0] is stored in cache but the second yes!! a<a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">0</a> is not stored in cache! Then the OS would bring to cache the pack of elements a<a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">0</a> to a<a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">4</a>. Then you do the third acces: a[0]*a[2] wich is out of cache again. Another cache miss!</p> <p>As you can colcude, case 1 is not a good solution for the problem. It causes lots of cache misses that we can avoid changing the code for the following:</p> <p>CASE 2:</p> <pre><code>for(int i = 0; i &lt; 10; i++) { for(int j = 0; j &lt; 1000; j++) { b[i] += a[i]*a[j]; } } </code></pre> <p>Here, as you can see, we are accessing the matrix as it's stored in memory. Consequently it's much better (faster) than case 1.</p> <p>About the third code you posted about loop tiling, loop tiling and also loop unrolling are optimizations that in most cases the compiler does automaticaly. <a href="https://stackoverflow.com/questions/5444303/loop-unrolling-vs-loop-tiling">Here's a very interesting post in stackoverflow explaining these two techniques;</a></p> <p>Hope it helps! (sorry about my english, I'm not a native speaker)</p>
    singulars
    1. This table or related slice is empty.
    1. POLoop interchange versus Loop tiling
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USCommunity
    1. USAntoni
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POLoop interchange versus Loop tiling
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COShould'nt it be a[0][0] followed by a[0][1], a[0][2] and so on ... the point about storage in memory?
      singulars
      1. PO
      1. UScodepk
    2. COWell, the way how elements are stored in memory, really depends on the architecture of the system you are working with. In some architectures elements are stored as you mention in your comment. However, this is not an important thing to understand the general concept of how should people program their loops if they know something about the architecture where their app will run in.
      singulars
      1. PO
      1. USAntoni
    3. CODid my answer help you?
      singulars
      1. PO
      1. USAntoni
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload