Algorithm 5 Parallel Random Forest

Input: $input\_data$ → Features, thresholds, left and right              children’s nodes 1: Step 1: Development of the $device \mathit{t}\mathit{r}\mathit{e}\mathit{e}\_\mathit{s}\mathit{t}\mathit{r}\mathit{u}\mathit{c}\mathit{t}\mathit{u}\mathit{r}\mathit{e} function$ 2: The single tree outputs $\mathit{m}\mathit{a}\mathit{x}$, the $\mathit{p}\mathit{r}\mathit{o}\mathit{b}\_\mathit{a}\mathit{r}\mathit{r}\mathit{a}\mathit{y}$ maximum index 3: Step 2: Building of the forest 4: $i=\mathit{b}\mathit{l}\mathit{o}\mathit{c}\mathit{k}\mathit{I}\mathit{d}\mathit{x}.\mathit{x};$ 5: $\mathit{m}\mathit{a}\mathit{x}=\mathit{t}\mathit{r}\mathit{e}\mathit{e}\_\mathit{s}\mathit{t}\mathit{r}\mathit{u}\mathit{c}\mathit{t}\mathit{u}\mathit{r}\mathit{e}(\mathit{i}\mathit{n}\mathit{p}\mathit{u}\mathit{t}\_\mathit{d}\mathit{a}\mathit{t}\mathit{a}, \mathit{p}\mathit{r}\mathit{o}\mathit{b}\_\mathit{a}\mathit{r}\mathit{r}\mathit{a}\mathit{y}, i);$ 6: $\mathit{a}\mathit{t}\mathit{o}\mathit{m}\mathit{i}\mathit{c}\mathit{A}\mathit{d}\mathit{d}\left(\&{\mathit{c}\mathit{l}\mathit{a}\mathit{s}\mathit{s}}_{\mathit{m}\mathit{a}\mathit{x}}, 1.0\right);$ 7: $\mathrm{F}\mathrm{i}\mathrm{n}\mathrm{d} \mathit{i}\mathit{m}\mathit{a}\mathit{x}, \mathrm{i}\mathrm{n}\mathrm{d}\mathrm{e}\mathrm{x} \mathrm{o}\mathrm{f} \mathrm{t}\mathrm{h}\mathrm{e} \mathit{c}\mathit{l}\mathit{a}\mathit{s}\mathit{s} \mathrm{m}\mathrm{a}\mathrm{x}\mathrm{i}\mathrm{m}\mathrm{u}\mathrm{m}$ Output: $\mathit{i}\mathit{m}\mathit{a}\mathit{x}$