\left( T_1 + \sum_{i=2}^{N} \frac{T_i^3}{T_1^2} \right) +
\Pstatic \cdot T_1 \cdot S_1 \cdot N
\end{equation}
-where $N$ is the number of parallel nodes, $T_i$ and $S_i$ for $i=1,\dots,N$ are
-the execution times and scaling factors of the sorted tasks. Therefore, $T_1$ is
+where $N$ is the number of parallel nodes, $T_i$ for $i=1,\dots,N$ are
+the execution times of the sorted tasks. Therefore, $T_1$ is
the time of the slowest task, and $S_1$ its scaling factor which should be the
highest because they are proportional to the time values $T_i$. The scaling
-factors are computed as in EQ~\eqref{eq:si}.
+factors $S_i$ are computed as in EQ~\eqref{eq:si}.
\begin{equation}
\label{eq:si}
S_i = S \cdot \frac{T_1}{T_i}
