Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 9 (1999), Issue 1, Pages 1-16

Sorting on Reconfigurable Meshes: An Irregular Decomposition Approach

1Department of Computer and Information Science, The Ohio State University, Columbus 43210, Ohio, USA
2Lucent Technologies, 67 Whippany Road, Whippany 07981, NJ , USA

Received 5 May 1997

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.