News for hackers. Stuff that matters.
Re:Parallel In-Place Merge Sort by brudgers on Wednesday October 01, 2014 @10:43AM (#8394731)
According to Knuth, Batcher's parallel sort was discovered in 1964 and published in 1968. [1] That it's been in Knuth for 35 years of course does not make general unawareness of it unsurprising.

To be a bit snarky, maybe the best piece of hardware to throw first at a sorting problem is a good book on sorting algorithms.

[1] TAoCP: Volume 3 [1978], page 111

Re:Parallel In-Place Merge Sort by taeric on Wednesday October 01, 2014 @11:06AM (#8394975)
:) Indeed, that is where I just found out about it. Although, do be fair and realize that many of the things in the latest revision of that book are newer than 1978, it was last updated in 1998. (Of course, many are also older...)

I have been going through what is undoubtedly a ridiculous phase of suggesting these books to everyone. I'm doing them in multiple passes where I am mostly skipping exercises for the first pass. Yes, the math is intense. No, they aren't as hard to approach as they have been made out to be.

Re:Parallel In-Place Merge Sort by brudgers on Wednesday October 01, 2014 @12:27PM (#8395674)
I'm cheap and that's why I purchased a used older edition. Incidently, though, I recently realized that all the obsolete material on searching tapes as secondary storage is pure Turing machine manipulation.

Anyway, I don't expect to ever master the material, but I learn something every time I open one up.

Re:Parallel In-Place Merge Sort by taeric on Wednesday October 01, 2014 @02:21PM (#8396588)
Still not exactly cheap, but the ebook versions are lower in price. Is what finally got me to read through them. (Well, that mainly because they are easy to take with me, now.) I did save up to buy physical copies, though. Plan to use those to go through the exercises.