All geek questions in one place

Is there an optimal parallel sorting algorithm for (EREW PRAM)?

Is there any way to get an inexpensive algorithm for sorting n integers with n processors for EREW PRAM ?

+4
source share
1 answer

Yes, there is a Richard Cole algorithm called "Parallel Merge Sort" that theoretically sorts input data (not just integers) into EREW PRAM in O (log n) using O (n) processors.

http://epubs.siam.org/doi/abs/10.1137/0217049

+1
source

Source: https://habr.com/ru/post/1441953/

More articles:


All Articles