Highlighted notes on:
cuSTINGER: Supporting Dynamic Graph Aigorithms for GPUs.
While doing research work with Prof. Kishore Kothapalli.
These people wrote the first data structure for maintaining dynamic graphs with NVIDIA CUDA GPUs. Unlike STINGER which uses a block linked-list and GT-STINGER which uses Array of Structures (AoS), here they instead used Structure of Arrays (SoA) which is not only more suitable to GPU memory access, but also allows smaller allocations modes (memory is a premium in GPU).
They use a custom memory manager which speeds up memory management (instead of using system memory manager). The data structure used is the standard adjacency list (CSR) and pointers are updated when edge list has to grow. It could handle upto 10 million updates per second (large batch sizes), and ran a static graph algorithm (triangle counting) 1-10% slower. This shows that cuSTINGER can also be used with static graph algorithms. Dynamic graph algorithms should run much faster.