Tag Archives: Graph Computing

Single Source Shortest Paths notes

Here are some notes I put together for single path shortest paths Advertisements

Posted in Algorithms, Uncategorized | Tagged | Leave a comment

Disassembly analysis for a simple vectorized loop

This is my post on analyzing the AVX2 disassemblies generated for a simple 20 double vectorized multiplication and add loop.

Posted in High Performance Computing | Tagged | Leave a comment

Quick documentation on ALS for Ligra

Here is the link and a short documentation to the ALS implementation in Ligra. Right now, it is about 1.5-2x faster than GraphChi depending on the input. I believe that it is faster only because of the overhead in GraphChi. … Continue reading

Posted in High Performance Computing | Tagged | Leave a comment

Notes on High Performance Collaborative SGD (actually it is Gradient Descent) in GraphMat and Ligra

Here is my notes on understanding, running and testing high performance collaborative filtering in GraphMat, a state of the art graph processing framework from Intel. I implemented an equivalent algorithm in Ligra, another high performance graph processing framework.

Posted in High Performance Computing | Tagged | Leave a comment

Developing High Performance Collaborative Filtering in Ligra

This is a post recording my effort on implementing ALS in Ligra.

Posted in High Performance Computing | Tagged | 1 Comment

What graphs did people use in benchmarking graph algorithms

This is my post summarizing what graphs did people use in publications for graph frameworks. I looked through Galois, Ligra and Intel GraphMat, GraphX.

Posted in High Performance Computing | Tagged | Leave a comment