SERVING THE QUANTITATIVE FINANCE COMMUNITY

 
User avatar
ww250
Topic Author
Posts: 38
Joined: April 23rd, 2010, 9:46 pm

parallel sorting algos

August 14th, 2011, 2:31 pm

I can think of parallel quicksort and mergesort, any other parallel sorting algorithms being implemented? And, what's the performance advantage/tradeoff of implementing them in a parallel way? It seems to me that creating loads of pthreads doing small amount of jobs is a waste and incurs huge overhead, there must be a balance between using serial sorts and parallel sorts. Would be great to see if someone could point me to an implementation of such parallel sorts being efficiently implemented/used. thanks a lot.
Last edited by ww250 on August 15th, 2011, 10:00 pm, edited 1 time in total.
 
User avatar
Polter
Posts: 2526
Joined: April 29th, 2008, 4:55 pm

parallel sorting algos

August 15th, 2011, 11:56 am

 
User avatar
rmax
Posts: 6080
Joined: December 8th, 2005, 9:31 am

parallel sorting algos

August 15th, 2011, 3:51 pm

AnimationsNo help I know, but nice pictures.
 
User avatar
zeta
Posts: 1969
Joined: September 27th, 2005, 3:25 pm
Location: Houston, TX
Contact:

parallel sorting algos

August 18th, 2011, 11:54 pm

there's an example of a bitonic sort in gpu gems; thrust is an excellent STL-like CUDA template library with a few examples too
 
User avatar
DevonFangs
Posts: 3004
Joined: November 9th, 2009, 1:49 pm

parallel sorting algos

August 22nd, 2011, 12:37 pm

QuoteOriginally posted by: rmaxAnimationsNo help I know, but nice pictures.Amazing
 
User avatar
ww250
Topic Author
Posts: 38
Joined: April 23rd, 2010, 9:46 pm

parallel sorting algos

August 23rd, 2011, 7:41 am

QuoteOriginally posted by: ww250I can think of parallel quicksort and mergesort, any other parallel sorting algorithms being implemented? And, what's the performance advantage/tradeoff of implementing them in a parallel way? It seems to me that creating loads of pthreads doing small amount of jobs is a waste and incurs huge overhead, there must be a balance between using serial sorts and parallel sorts. Would be great to see if someone could point me to an implementation of such parallel sorts being efficiently implemented/used. thanks a lot.Anyone could point me to an efficient quicksort or mergesort parallel implementation?
 
User avatar
zeta
Posts: 1969
Joined: September 27th, 2005, 3:25 pm
Location: Houston, TX
Contact:

parallel sorting algos

August 23rd, 2011, 12:50 pm

what platform? Thrust (CUDA) has a merge sort, or you could check this out -> https://wiki.cc.gatech.edu/multicore/in ... Algorithms
ABOUT WILMOTT

PW by JB

Wilmott.com has been "Serving the Quantitative Finance Community" since 2001. Continued...


Twitter LinkedIn Instagram

JOBS BOARD

JOBS BOARD

Looking for a quant job, risk, algo trading,...? Browse jobs here...


GZIP: On