Slashdot Mirror


Sorting Algorithm Breaks Giga-Sort Barrier, With GPUs

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."

5 of 187 comments (clear)

  1. Re:Excel Charts by Anonymous Coward · · Score: -1, Troll

    I'm sure they find it equally disappointing that you suck at math.

  2. Slashdot dont need no GPU.... by Anonymous Coward · · Score: 0, Troll

    ... to sort my first post to the top.

    So why is this GPU sorting ability important to me?

  3. Re:Excel Charts by Anonymous Coward · · Score: -1, Troll

    Why is your shit all 'tarded and shit?

  4. Re:Um... by martin-boundary · · Score: 1, Troll

    The problem with big-oh notation is that the constant isn't explicit, so for any given n (pick as large as desired), it is possible that O(nlogn) As always, in theory there's no difference between theory and practice, but in practice there is...

  5. Re:Um... by Anonymous Coward · · Score: -1, Troll

    ....Big-O originates from pure mathematics and is an abstract measure divorced from specific computing implementations. its not even tangentially related to hardware. learn to science, you bitchface fuckwit.