全排列递归算法的并行化

Parellel Algorithms of Full Permutation Recursion Algorithm

全排列问题的递归算法结构清晰,可读性强.为了提高排列的效率,给出了全排列递归算法在MIMP-CREW模型和单指令多数据流的EREW模型上的并行化算法及实例分析.给出的算法成本是最低的.

Full permutation recursion algorithm is simple and readable, In order to increase efficiency of the recursion algorithm, two parellel recursion algorithms in MIMD-CREW model and SIMD-EREW model and their examples are presented. The costs of these two parellel algorithms are the lowest.