What is GraphBLAS? – AldenMath

CRANK

A single statement in GraphBLAS can do a lot inside. This gives me, the library implementor, a great deal of scope to optimize the operation.  It gives the graph algorithm developer a powerful and expressive way to write graph algorithms, kind of like a MATLAB for graphs.All the gnarly details of the graph are hidden inside the GraphBLAS matrix.  I'll take care of those details; you write the high-level algorithms.  You don't have to write code that walks across nodes and edges, one at a time.  Then I can do the gnarly stuff asymptotically fast (and fast in practice).  I'm currently working on a parallel implementation, both on the CPU (with OpenMP) and on the GPU (in CUDA), which speeds things up even more. More on that in a future blog.The community has been designing GraphBLAS for years (see for example the 2011 book edited by Kepner and Gilbert), and finalized a specification of the library about 2 years ago.  They asked me to write the reference implementation, which you can read…