A parallel sorting algorithm on an eight-neighbor processor array

The authors deal with a new parallel sorting algorithm on an eight-neighbor processor array with wraparounds in the rows. The algorithm is very simple because it is composed of the iteration of only a primitive operation, comparing and exchanging four elements simultaneously. Each processor (processing element), arranged in a two-dimensional array can communicate with 8 neighbouring processors (if they exist). By fully making use of its communication capability and wraparounds properties, the algorithm sorts n×n elements in the row-major order, and yields the sorting time of 3(n +1)(2t_r+t_c), where t _r and t_c are defined as the times for a unit routing step and a comparison processing, respectively