20 citations · 35 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DC2019
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Oded Green, James Fox, Jeffrey Young +2
Graph processing is typically considered to be a memory-bound rather than compute-bound problem. One common line of thought is that more available memory bandwidth corresponds to b…
cs.DS2019
HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure
Oded Green
Hash tables are ubiquitous and used in a wide range of applications for efficient probing of large and unsorted data. If designed properly, hash-tables can enable efficients look u…