Branch-avoiding graph algorithms
… should seek graph algorithms and implementations that avoid branches. As a proof-of-concept,
we devise such branch-avoiding implementations of the Shiloach-Vishkin algorithm for …
we devise such branch-avoiding implementations of the Shiloach-Vishkin algorithm for …
[PDF][PDF] When merging and branch predictors collide.
O Green�- IA3@ SC, 2014 - researchgate.net
… graph contractions. Merging is similar to set intersection which has many applications found
in graph … On the other-hand, we showed the a simple branch-avoiding algorithm has near …
in graph … On the other-hand, we showed the a simple branch-avoiding algorithm has near …
Logarithmic radix binning and vectorized triangle counting
… data dependencies and vectorize the algorithms. Using the branchavoiding model we show
to … mis-prediction is high for data dependent applications (such as graph algorithms) and that …
to … mis-prediction is high for data dependent applications (such as graph algorithms) and that …
The case for domain-specialized branch predictors for graph-processing
… While other works have previously noted that branch predictors perform poorly on many
graph-processing algorithms [9], their analysis was limited to two-bit predictors that have well-…
graph-processing algorithms [9], their analysis was limited to two-bit predictors that have well-…
Improving Scheduling for Irregular Applications with Logarithmic Radix Binning
… This is the case for graph algorithms, SpMV, and other irregular problems such as … vectorized
branch avoiding model introduced in [13], [23] (which extend the branch avoiding model …
branch avoiding model introduced in [13], [23] (which extend the branch avoiding model …
To push or to pull: On reducing communication and synchronization in graph computations
… We consider 11 graph algorithms, 3 programming models, 2 graph abstractions, and …
The graph algorithms that we consider can be cast as matrixvector multiplications (MVs) A ⊗ …
The graph algorithms that we consider can be cast as matrixvector multiplications (MVs) A ⊗ …
Accelerating {PageRank} using {Partition-Centric} Processing
… To implement the branch avoiding gather function, instead of using a condition check over …
efficient programming model for other graph algorithms or graph analytics frameworks. In this …
efficient programming model for other graph algorithms or graph analytics frameworks. In this …
A fast and simple approach to merge and merge sort using wide vector instructions
A Watkins, O Green�- …�applications: architectures and algorithms�…, 2018 - ieeexplore.ieee.org
… We start with a branch-avoiding merge algorithm and then use the Merge Path algorithm to
split up … Graph searching uses sorting to speedup lookups. A variety of high-speed sorting …
split up … Graph searching uses sorting to speedup lookups. A variety of high-speed sorting …
Locality exists in graph processing: Workload characterization on an ivy bridge server
S Beamer, K Asanovic…�- 2015 IEEE International�…, 2015 - ieeexplore.ieee.org
… 1) Breadth-First Search (BFS) is actually only a traversal order, but it is so fundamental to
graph algorithms that we include it in our suite. We convert BFS into a kernel by tracking the …
graph algorithms that we include it in our suite. We convert BFS into a kernel by tracking the …
[PDF][PDF] On the Design of an Efficient Hardware Accelerator for Large Scale Graph Analytics
YS Horawalavithana - sameeravithana.github.io
… The approach is flexible on applying existing graph algorithms without any change of
their … 3) Branch-avoiding models [9]: This study brings new insights to domain specific …
their … 3) Branch-avoiding models [9]: This study brings new insights to domain specific …