A new approach for reconfiguring multipipeline arrays from two-dimensional arrays is analysed. The proposed reconfiguration approach is fully characterised and the conditions for switching and routing are given. A polynomial time complexity algorithm is proposed for the reconfiguration of multipipeline arrays. This algorithm is based on a novel divide-and-conquer technique; this technique is based on a heuristic condition for dividing an array into multiple sub-arrays. This results in a lower internal delay. This condition also achieves lower values for average intercell and pipeline delays than previous approaches. It is proved that using the proposed algorithm, maximum multipipeline generation is possible. A switching arrangement consisting of two buses per channel is required.