20 citations · 35 across the 9 of their papers we have counts for
Showing 2014 · cs.DCShow all
2 papers · 2 filters
cs.DC2014
Branch-Avoiding Graph Algorithms
Oded Green, Marat Dukhan, Richard Vuduc
This paper quantifies the impact of branches and branch mispredictions on the single-core performance for two classes of graph problems. Specifically, we consider classical algorit…
cs.DC2014★ 10 cited
Merge Path - A Visually Intuitive Approach to Parallel Merging
Oded Green, Saher Odeh, Yitzhak Birk
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing t…