Hacker News Reader

> An example would be hash lookups in Ruby

You mean for a hash table? I don't think you'll be seeing that any time soon. Hash computation will almost certainly be faster on the primary cpu then just the scheduling and waiting overhead. And then the GPU isn't particularly good at any pointer chasing required for the rest of the lookup.

View on HN

Scheduling and waiting overhead? What waiting?

I assumed that in most cases when you deal with a hash table you want some data returned. That's perhaps not true in the case of adding to the hash table, but if you don't need the result you can just add it to a queue, and do it in any old thread, since it's clearly not performance sensitive.

Reply on news.ycombinator.com