Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
smallpipe
74 days ago
|
parent
|
context
|
favorite
| on:
Hashed sorting is typically faster than hash table...
Could you reduce the BW requirement of the hash table by using an atomic increment instruction instead of read-modify-write ? It still performs a read modify write, but further down in the hierarchy, where more parallelism is available.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: