5 ms·
> 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 certainl
by Arelius 13y ago
> 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.
- metrix 13y agoScheduling and waiting overhead? What waiting?
- Arelius 13y agoI 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.