更改

Partitioning the graph needs to be done carefully - there is a trade-off between low communication and even size partitioning But partitioning a graph is a NP-hard problem, so it is not feasible to calculate them. Instead, the following heuristics are used.

Partitioning the graph needs to be done carefully - there is a trade-off between low communication and even size partitioning But partitioning a graph is a NP-hard problem, so it is not feasible to calculate them. Instead, the following heuristics are used.

图的划分需要仔细地进行——在低通信和甚至大小划分之间有一个权衡。但是图的划分是一个 np 难问题，因此计算它们是不可行的。相反，使用以下启发式。

图的划分需要仔细地进行——在低通信和甚至大小划分之间有一个权衡。但是图的划分是一个<big>NP</big> 难问题，因此计算它们是不可行的。相反，使用以下启发式。

2D partitioning: Every processor gets a submatrix of the adjacency matrix. Assume the processors are aligned in a rectangle <math>p = p_r \times p_c</math>, where <math>p_r

2D partitioning: Every processor gets a submatrix of the adjacency matrix. Assume the processors are aligned in a rectangle <math>p = p_r \times p_c</math>, where <math>p_r

2 d 分区: 每个处理器都有一个邻接矩阵矩阵的子矩阵。假设处理器在一个矩形 < math > p = p _ r 乘以 p _ c </math > 中对齐，其中 < math > p _ r

2 d 分区: 每个处理器都有一个邻接矩阵的子矩阵。假设处理器在一个矩形 < math > p = p _ r 乘以 p _ c </math > 中对齐，其中 < math > p _ r

</math> and <math>p_c

</math> and <math>p_c