Mergesort Implementation

[Fernando Mussel]

Hi guys,

I'm a CompSci student and I'm currently studying GPU sorting algorithms, as part of an unit that I'm undertaking. One of the papers that I read 

[Efficient Parallel Merge Sort for Fixed and Variable Length Keys, 2012], (which is also listed as a reference of cudpp library) describes a very interesting

mergesort implementation, which I wanted to take a further look into. I digged through cudpp's mergesort source code and it appears to me that it implements

the mergesort described in the aforementioned paper. Is that correct? 

Thank you for your time.

[Andrew Davidson]

Hi Fernando,

Yes that's correct this code should match the implementation from the paper.

As a note though, there is a newer mergesort by Sean Baxter of NVIDIA here which is the current state of the art mergesort. 

Andrew

--
You received this message because you are subscribed to the Google Groups "CUDPP" group.
To unsubscribe from this group and stop receiving emails from it, send an email to cudpp+un...@googlegroups.com.
To post to this group, send email to cu...@googlegroups.com.
Visit this group at http://groups.google.com/group/cudpp.
For more options, visit https://groups.google.com/d/optout.

[Fernando Mussel]

Thank you for not only taking the time to answer me, but also for pointing me to Sean's mergesort implementation. I had, somehow, missed it.

Thanks