seb/XM_40017
1
0
Fork 0
mirror of https://github.com/fverdugo/XM_40017.git synced 2025-11-10 13:24:23 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge pull request #51 from VictorianHues/main

Browse Source
This commit is contained in:
Francesc Verdugo 2024-09-16 22:03:36 +02:00 committed by GitHub
commit e146513dfe
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notebooks/matrix_matrix.ipynb
View File

@ -325,7 +325,7 @@
"source": [ "source": [
"### Parallel algorithms\n", "### Parallel algorithms\n",
"\n", "\n",
"The loops over `i` and `j` are trivially parallel implies that all the entries of matrix C can be potentially computed in parallel. However, *which it the most efficient solution to solve all these entries in parallel in a distributed system?* To find this we will consider different parallelization strategies:\n", "The loops over `i` and `j` are trivially parallel, implying that all the entries of matrix C can be potentially computed in parallel. However, *which is the most efficient solution to solve all these entries in parallel in a distributed system?* To find this we will consider different parallelization strategies:\n",
"\n", "\n",
"- Algorithm 1: each worker computes a single entry of C\n", "- Algorithm 1: each worker computes a single entry of C\n",
"- Algorithm 2: each worker computes a single row of C\n", "- Algorithm 2: each worker computes a single row of C\n",