A shortperiodic two-dimensional systolic sorting algorithm
Uwe Schwiegelshohn · 2003
An algorithm is presented for sorting n/sup 2/ elements on a two-dimensional systolic processor array. It is proved that this algorithm requires O(nlog n) steps in the worst case. The state of the whole processor array recurs every eight steps, so no global control is necessary. An easy realization of this array on a VLSI circuit is thus possible, and the structure of an elementary processor cell is given. The sorting algorithm is well suited to solve problems of data transfer in locally connected parallel processors with distributed energy.>