Abstract
Most algorithms for reconfigurable meshes (R-meshes) are based on the divide-and-conquer (DAC) strategy. Although the strategy per se does not require the subproblems to be equal in size, existing DAC algorithms for R-meshes do divide the problem approximately evenly. This paper demonstrates that dividing a problem evenly is not necessarily a good way to decompose a problem. There are occasions on which an irregular decomposition scheme may be preferable. We take this approach and obtain a new sorting algorithm. Our sorting algorithm has several strengths: it is simple, scalable, and as broadcast-efficient as the best known result.