By Topic

Time- and VLSI-optimal sorting on enhanced meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Bhagavathi, D. ; Dept. of Math. & Comput. Sci., Fairleigh Dickinson Univ., Madison, NJ, USA ; Gurla, H. ; Olariu, S. ; Schwing, J.L.
more authors

Sorting is a fundamental problem with applications in all areas of computer science and engineering. In this work, we address the problem of sorting on mesh connected computers enhanced by endowing each row and each column with its own dedicated high-speed bus. This architecture, commonly referred to as a mesh with multiple broadcasting, is commercially available and has been adopted by the DAP family of multiprocessors. Somewhat surprisingly, the problem of sorting m, (m⩽n), elements on a mesh with multiple broadcasting of size √n×√n has been studied, thus far, only in the sparse case, where m∈Θ(√n) and in the dense case, where m∈ΘO(√n). Yet, many applications require using an existing platform of size √n×√n for sorting m elements, with √n<m⩽n. Our main contribution is to present the first known adaptive time- and VLSI-optimal sorting algorithm for meshes with multiple broadcasting. Specifically we show that, for every choice of a constant 0<ε⩽½, it is possible to sort m elements, n½+ε⩽m⩽n, stored in the leftmost [m/√n] columns of a mesh with multiple broadcasting of size √n×√n in Θ(m/√n) time

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:9 ,  Issue: 10 )