Results 1 -
1 of
1
A regular N-node bounded degree network for sorting N² keys with optimal speedup
- In Proc. of the International Workshop on Parallel Image Analysis (IWPIA '95
, 1995
"... sorting algorithm called Shuffle Ring Sort (SRS) for distributed memory systems with a regular bounded degree interconnection network. Our algorithm is optimal in the sense that it achieves a time complexity of O(N log N ) for sorting at least N keys on N processors. ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
sorting algorithm called Shuffle Ring Sort (SRS) for distributed memory systems with a regular bounded degree interconnection network. Our algorithm is optimal in the sense that it achieves a time complexity of O(N log N ) for sorting at least N keys on N processors.
