Regular processor arrays for matrix algorithms with pivoting

It is shown how to obtain regular (though nonsystolic) processor arrays for algorithms with pivoting. First, the fact that pivoting algorithms cannot be systolic is established. Then it is shown how regular iterative algorithms can be formulated for the Gaussian elimination algorithm with partial pivoting and how the algorithm can then be implemented on the so-called regular iterative arrays (locally connected arrays of essentially identical processor modules, with register pipelines and/or LIFO (last-in/first-out) buffers in some of the links).<>