A regular N-node bounded degreenetwork for sorting N 2 keys withoptimal

@inproceedings{speedupAndreas1995ARN,
  title={A regular N-node bounded degreenetwork for sorting N 2 keys withoptimal},
  author={speedupAndreas and Bieniek and Leonel Gerald and SchreiberTechnische and Universit},
  year={1995}
}
  • speedupAndreas, Bieniek, +2 authors Universit
  • Published 1995
| In this paper we present a new parallel sorting algorithm called Shuue Ring Sort (SRS) for distributed memory systems with a regular bounded degree in-terconnection network. Our algorithm is optimal in the sense that it achieves a time complexity of O(N logN) for sorting at least N 2 keys on N processors. The assumption that the problem size grows at… CONTINUE READING