seb/XM_40017
1
0
Fork 0
mirror of https://github.com/fverdugo/XM_40017.git synced 2025-12-29 10:18:31 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

build based on e146513

Browse Source
This commit is contained in:
Documenter.jl
2024-09-16 20:06:22 +00:00
parent 107886ceb5
commit 7817ee9c51
24 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
dev/matrix_matrix_src/index.html
View File

@@ -7883,7 +7883,7 @@ d) O(N³)</code></pre>
</div>
<div class="jp-InputArea jp-Cell-inputArea"><div class="jp-InputPrompt jp-InputArea-prompt">
</div><div class="jp-RenderedHTMLCommon jp-RenderedMarkdown jp-MarkdownOutput" data-mime-type="text/markdown">
<h3 id="Parallel-algorithms">Parallel algorithms<a class="anchor-link" href="#Parallel-algorithms"></a></h3><p>The loops over <code>i</code> and <code>j</code> are trivially parallel implies that all the entries of matrix C can be potentially computed in parallel. However, <em>which it the most efficient solution to solve all these entries in parallel in a distributed system?</em> To find this we will consider different parallelization strategies:</p>
<h3 id="Parallel-algorithms">Parallel algorithms<a class="anchor-link" href="#Parallel-algorithms"></a></h3><p>The loops over <code>i</code> and <code>j</code> are trivially parallel, implying that all the entries of matrix C can be potentially computed in parallel. However, <em>which is the most efficient solution to solve all these entries in parallel in a distributed system?</em> To find this we will consider different parallelization strategies:</p>
<ul>
<li>Algorithm 1: each worker computes a single entry of C</li>
<li>Algorithm 2: each worker computes a single row of C</li>