Algorithm 2. Pseudocode of the naive implementation of the intertask approach.
procedure PFA($H[]$, $R[]$, $Q[]$, $\alpha []$, $\delta []$, $\zeta []$, $m$, $n$)
for $i\leftarrow \mathrm{1,}m$ do
$r\leftarrow R_i$
$q\leftarrow Q_i$
$\alpha \leftarrow {\alpha }_i$
$\delta \leftarrow {\delta }_i$
$\zeta \leftarrow {\zeta }_i$
for $j\leftarrow \mathrm{1,}n$ do
$h\leftarrow H_i$
if $i>1$ then
$MU\leftarrow M{M}_j$
$IU\leftarrow I{I}_j$
$DU\leftarrow D{D}_j$
else
$MU\leftarrow IU\leftarrow 0$
$DU\leftarrow \frac{1}{n}$
$MID\leftarrow 0.9\cdot DU$
end if
if $H=R$ then
$\lambda \leftarrow q/3$
else
$\lambda \leftarrow 1-q$
end if
$DN\leftarrow \zeta \cdot MN+0.1\cdot DN$
$MN\leftarrow \lambda \cdot MID$
$IN\leftarrow \delta \cdot MU+0.1\cdot IU$
$MID\leftarrow \alpha \cdot MU+0.9\cdot IU+0.9\cdot DU$
$M{M}_j\leftarrow MN$
$I{I}_j\leftarrow IN$
$D{D}_j\leftarrow DN$
if $i=m$ then
$result=M{M}_j+I{I}_j$
end if
end for
end for
return $result$
end procedure