You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Perhaps some blocking strategy, such as that used for matrix multiplications, would be
advantageous: when getting from the history buffer, we can load history for N nodes (where
N is just less than what fills the L3 cache) & increment the coupling vector by the
contributions of those nodes, then continue with next chunk of N nodes.
The text was updated successfully, but these errors were encountered:
(thx to @i-Zaak for the idea)
Perhaps some blocking strategy, such as that used for matrix multiplications, would be
advantageous: when getting from the history buffer, we can load history for N nodes (where
N is just less than what fills the L3 cache) & increment the coupling vector by the
contributions of those nodes, then continue with next chunk of N nodes.
The text was updated successfully, but these errors were encountered: