Elsevier

Parallel Computing

Volume 20, Issue 1, January 1994, Pages 115-124
Parallel Computing

Practical aspects and experiences
Parallel sorting revisited

https://doi.org/10.1016/0167-8191(94)90116-3Get rights and content

Abstract

In this paper again some parallel sorting algorithms for the hypercube are described. They are compared to a recently published parallel sorting procedure for the same topology and it is shown that considering essential properties of the available hardware and its topology during the design of parallel algorithms is instructive.

References (6)

There are more references available in the full text version of this article.

Cited by (3)

  • Efficient massively parallel quicksort

    1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View full text