We are building a graph processing library on GPUs: <a href="http:&#x2F;&#x2F;gunrock.github.io&#x2F;" rel="nofollow">http:&#x2F;&#x2F;gunrock.github.io&#x2F;</a>
Our publication explains why our library runs faster, and in one word: load-balancing, since fundamentally, graph problems are irregular problems. If you look at the road map section, we are moving towards dynamic graphs and also planning to try out asynchronous method by using MIS&#x2F;coloring. Please try it out, any kind of contribution is welcome.