• We’re currently investigating an issue related to the forum theme and styling that is impacting page layout and visual formatting. The problem has been identified, and we are actively working on a resolution. There is no impact to user data or functionality, this is strictly a front-end display issue. We’ll post an update once the fix has been deployed. Thanks for your patience while we get this sorted.

Quicksort parallel

K

kimiya_ab

Junior Member
hello everybody

I want to use quicksort in parallel form for my project but I really don't want to use the NVIDIA sample for that matter because I have to give a full hour speech about how exactly every part of my code work and the NVIDIA sample is extremely general and hard to understand.
Does anyone have any idea? any simple form of code for this particular sorting ??
I would appreciate your help.
 
Welcome to AnandTech Forums!

First, is this for Cuda, OpenCL, or for CPU work?

Second, does it have to be Quicksort? Merge sort is almost as fast, and simpler IMHO. Edit: depending on how you parallel Quicksort, merge sort could wind up a lot slower - it has a linear final pass. But parallel Quicksort does seem insanely complicated that way.
 
Last edited:
Ken g6 said:
Welcome to AnandTech Forums!

First, is this for Cuda, OpenCL, or for CPU work?

Second, does it have to be Quicksort? Merge sort is almost as fast, and simpler IMHO.
Click to expand...


thank u so much,

yeah I should have mentioned that I need it in Cuda!
and for ur 2nd question, yea !!! it has to be quicksort 🙁
 
>> I really don't want to use the NVIDIA sample for that matter because I have to give a full hour speech about how exactly every part of my code work and the NVIDIA sample is extremely general and hard to understand.

It sounds like you would learn a lot about CUDA by working through this example until you do fully understand it. If you plan to continue to use CUDA it might be worth the time.

Goal 1: Get an OK grade with lowest effort possible.
Goal 2: Learn as much as you can about the subject, and become a superior developer. Get an A as a side effect.

Pick one 🙂
 
beginner99 said:
OP, I always picked 1 back than and kind of regret it a bit. So yeah, pick 2 please.
Click to expand...

the problem is that the quicksort is not a great choice for learning!
and I just need its code bcuz I m forced to use it. that's why I think there is absolutely no point for learning the quicksort sample and I want a quick easy way out of it. I even figured out how merge sort sample works but when I asked my professor for changing my method to merge sort cuz it's better she said No.
trust me there no learning point for quicksort in Cuda if there were such thing I would never have ask for the solution !!
 
So you don't think you will learn anything useful by studying the "hard to understand" parts of Nvidia's code until they are easy to understand?

I'm not working with CUDA and haven't looked at their code, so I'm not qualified to agree or disagree. But if those parts use techniques that would help you in other tasks then you might be wrong.
 
You must log in or register to reply here.

TRENDING THREADS

Back
Top