Parallel kd-Tree Based Approach for Computing the Prediction Horizon Using Wolf’s Method

Figure 4

The circles in the figure are the processes with a unique identifier. Each process has a local kd-tree which represents a -dimensional subspace formed by the data decomposition technique. The transposition of all the subspaces represents the whole space, such as the space shown in the example of Figure 2. The lines between processes represent the bidirectional synchronization.