Slashdot Mirror

← Back to Stories (view on slashdot.org)

Sorting Algorithm Breaks Giga-Sort Barrier, With GPUs

Posted by timothy on from the quick-like-double-time dept.

An anonymous reader writes "Researchers at the University of Virginia have recently open sourced an algorithm capable of sorting at a rate of one billion (integer) keys per second using a GPU. Although GPUs are often assumed to be poorly suited for algorithms like sorting, their results are several times faster than the best known CPU-based sorting implementations."

3 of 187 comments (clear)

  1. No Surprise... by Anonymous Coward · · Score: 5, Funny

    GPUs have always been better at sorting your money from your wallet.

  2. I think the bubble sort would be the wrong way to by joeyadams · · Score: 4, Funny

    I think the bubble sort would be the wrong way to go.

    —Barack Obama

  3. Re:Not a barrier by PatPending · · Score: 4, Funny

    Actually, if you look at shockwave dynamics during the moment an object crosses from subsonic to supersonic velocity, it can very easily be considered much more of a barrier than 1gkeys/sec can.

    Actually in this case, your analogy should use ludicrous speed.

    --
    What one fool can do, another can. (Ancient Simian Proverb)