In the mesh-connected processors, some processor elements (PEs) become ineffective due to high temperature, overload and other factors, which can affect the stability of the system. This paper deals with the problem of reconfiguring the largest possible subarray from the processor with faults under the row and column rerouting constraint. Firstly, a flexible routing scheme, based on dynamic programming, is proposed to construct the local optimal logical columns. Secondly, we discuss and revise the PEs that cannot be connected between every two logical columns under this scheme. Finally, an efficient algorithm is presented to construct the maximum subarray in polynomial time. The experimental results show that, both on the random and clustered fault scenarios, the proposed algorithm under flexible rerouting scheme is capable of constructing the larger scale logical arrays. On a 48 × 48 host array with 15% fault density, the improvement on the use of fault-free PEs is up to 6.22% for random faults. On a 256 × 256 host array, the improvement can be up to 85.60% for clustered faults. Moreover, the proposed algorithm runs faster than previous algorithms under different size arrays and fault densities, the average improvement in running time is up to 99% compared with state-of-the-art.

在网状连接的处理器中，由于高温，过载和其他因素（可能会影响系统的稳定性），某些处理器元件（PE）变得无效。本文讨论了在行和列重路由约束下，出现故障的处理器重新配置最大可能子数组的问题。首先，提出了一种基于动态规划的柔性路由方案，以构造局部最优逻辑列。其次，我们讨论并修改了在此方案下每两个逻辑列之间无法连接的PE。最后，提出了一种在多项式时间内构造最大子数组的有效算法。实验结果表明，在随机故障和群集故障情况下，该算法在灵活的重路由方案下能够构造较大规模的逻辑数组。在故障密度为15％的48×48主机阵列上，对于随机故障，无故障PE的使用提高了6.22％。在256×256主机阵列上，针对群集故障的改进最多可达到85.60％。此外，所提出的算法在不同的大小阵列和故障密度下比以前的算法运行速度更快，与最新技术相比，运行时间的平均改善高达99％。