Time- and VLSI-optimal sorting on enhanced meshes

Authors

D. Bhagavathi, Fairleigh Dickinson University
H. Gurla, ADC Telecom, Sunnyvale, CA
S. Olariu, Old Dominion University
James L. Schwing, Central Washington University
L. Wilson, Old Dominion University
Jingyuan Zhang, ECI Systems and Engineering, Virginia Beach, VA

Department or Administrative Unit

Computer Science

Document Type

Article

Author Copyright

Copyright © 1998, IEEE

Publication Date

10-1998

Journal

IEEE Transactions on Parallel and Distributed Systems

Abstract

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/spl les/n), elements on a mesh with multiple broadcasting of size /spl radic/n/spl times//spl radic/n has been studied, thus far, only in the sparse case, where m/spl isin//spl Theta/(/spl radic/n) and in the dense case, where m/spl isin//spl Theta/O(/spl radic/n). Yet, many applications require using an existing platform of size /spl radic/n/spl times//spl radic/n for sorting m elements, with /spl radic/n

Comments

This article was originally published in IEEE Transactions on Parallel and Distributed Systems. The article from the publisher can be found here.

Recommended Citation

Bhagavathi, D., Gurla, H., Olariu, S., Schwing, J. L., Wilson, L., & Zhang, J. (1998). Time- and VLSI-optimal sorting on enhanced meshes. IEEE Transactions on Parallel and Distributed Systems, 9(10), 929–937. https://doi.org/10.1109/71.730522