Sorting on a Mesh-Connected Parallel Computer.
Abstract
Two algorithms are presented for sorting M to the 2nd power elements on an nxn mesh-connected processor array that require O(n) routing and comparison steps. The best previous algorithm takes time O(n 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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1976
- Accession Number
- ADA022808
Entities
People
- C. D. Thompson
- H. T. Kung
Organizations
- Carnegie Mellon University