A regular N-node bounded degree network for sorting N² keys with optimal speedup (1995)
by
Andreas Bieniek
,
Michael Nölle
,
Gerald Schreiber
| Venue: | In Proc. of the International Workshop on Parallel Image Analysis (IWPIA '95 |
| Citations: | 3 - 2 self |
BibTeX
@INPROCEEDINGS{Bieniek95aregular,
author = {Andreas Bieniek and Michael Nölle and Gerald Schreiber},
title = {A regular N-node bounded degree network for sorting N² keys with optimal speedup},
booktitle = {In Proc. of the International Workshop on Parallel Image Analysis (IWPIA '95},
year = {1995},
pages = {253--266}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
