Sorting on a Mesh-Connected Parallel Computer.
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
Two algorithms are presented for sorting M to the 2nd power elements on an nxn mesh-connected processor array that require On routing and comparison steps. The best previous algorithm takes time On log n. The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional mesh-connected processor arrays are also given. Author
- Computer Hardware
- Computer Systems