Need for parallel sorting algorithms

elemental / Elemental

Distributed-memory, arbitrary-precision, dense and sparse-direct linear algebra, conic optimization, and lattice reduction

Other

503 stars 111 forks source link

Need for parallel sorting algorithms #101

Open poulson opened 8 years ago

poulson commented 8 years ago

Several routines in Elemental (e.g., sorting eigenpairs and singular triplets, and computing medians) requires sorting distributed data structures. It would be worthwhile for Elemental to incorporate (and/or implement) distributed selection sort and bitonic sort.

poulson commented 7 years ago

As mentioned in Issue #7, https://patflick.github.io/mxx/ might be a good solution for distributed sample sort.