Hello all!
I was thinking of developing something (maybe a tool or a library generator) that performs Automatic Algorithm Selection (AAS). Now what this does, is based on the input and your platform characteristics and given choices of algorithms (for example in this case 'Sorting'), the most optimal algorithm for that problem will be used.
Now there is already an existing AAS (both library generators) for Sequential and Parallel sorting algorithms. However, I think that there is none yet which considers BOTH Sequential and Parallel strategies, which is what I plan to make.
What I am thinking about is, are Parallel strategies ALWAYS perform better than Sequential strategies or vice versa? Because if so, then my research will just be wasted.
Please help me on this one! Thanks!
Automatic Algorithm Selection
Started by bloodfire, Nov 20 2009 11:03 PM
3 replies to this topic
#1
Posted 20 November 2009 - 11:03 PM
|
|
|
#2
Posted 21 November 2009 - 09:11 PM
It would seem that Parallel might be hardware dependent for its performance.
#3
Posted 22 November 2009 - 01:41 AM
Well yes, parallel is dependent on the hardware.
But given that, you can use parallel strategy in a platform, would there still be instances in which you will consider using sequential strategies?
Thank you!
But given that, you can use parallel strategy in a platform, would there still be instances in which you will consider using sequential strategies?
Thank you!
#4
Posted 22 November 2009 - 06:06 AM
Parallel will use more resources to create new threads. If you gain no advantage from a processor that can run the threads independently, then you're wasting cycles to create them.


Sign In
Create Account

Back to top









