Skip to content
This repository has been archived by the owner on Jun 22, 2024. It is now read-only.

Commit

Permalink
Update algo description
Browse files Browse the repository at this point in the history
  • Loading branch information
sondt1337 authored Jan 30, 2024
1 parent e84b5dd commit 4fc5c50
Showing 1 changed file with 3 additions and 5 deletions.
8 changes: 3 additions & 5 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -34,9 +34,7 @@ Z_{m,1} & \cdots & Z_{m,p}
$$

with
$$
Z_{u, v} = \sum_{k=1}^{n} X_{u,k} Y_{v, k}, u \in {1, 2, ..., m}, v \in {1, 2, 3, ..., p}
$$
$$Z_{u, v} = \sum_{k=1}^{n} X_{u,k} Y_{v, k}, u \in {1, 2, ..., m}, v \in {1, 2, 3, ..., p}$$


### 1. Encode
Expand All @@ -54,8 +52,7 @@ where F and G are encode function satisfied F: $\mathbb{F}^{\frac{M}{m} \times \

### 2. Task computing
$i$-th worker calculate $F(z_{i})G(z_{i})$. As soon as worker $i$ completes the computation, it will send
the result back to themaster node, noting that the returned
results from the workers may vary in speed depending on each worker’s computational capabilities, and the returned results may not be accurate.
the result back to themaster node, noting that the returned results from the workers may vary in speed depending on each worker’s computational capabilities, and the returned results may not be accurate.

$$
\begin{align*}
Expand All @@ -78,6 +75,7 @@ P_R = mnp + n - 1
$$

and communication load is:

$$
\begin{align*}
C_L = P_D \frac{MP}{mp}
Expand Down

0 comments on commit 4fc5c50

Please sign in to comment.