Abstract: Systems and methods are provided for performing random walk graph computing. One method may comprise generating a subset of walkers on a graph, maintaining the generated subset of walkers in a walker pool in a memory, loading a coarse-grained block of the graph from a non-volatile storage into a block buffer of the memory, generating pre-sampled edges for vertices in the coarse-grained block, storing the pre-sampled edges into a pre-sampled edge buffer allocated for the coarse-grained block and moving one or more walkers of the generated subset of walkers using the pre-sampled edges stored in the pre-sampled edge buffer. The generated subset of walkers may have an initial number determined based on a memory space allocated to the walker pool.

Abstract: Systems and methods are provided for performing random walk graph computing. One method may comprise generating a subset of walkers on a graph, maintaining the generated subset of walkers in a walker pool in a memory, loading a coarse-grained block of the graph from a non-volatile storage into a block buffer of the memory, generating pre-sampled edges for vertices in the coarse-grained block, storing the pre-sampled edges into a pre-sampled edge buffer allocated for the coarse-grained block and moving one or more walkers of the generated subset of walkers using the pre-sampled edges stored in the pre-sampled edge buffer. The generated subset of walkers may have an initial number determined based on a memory space allocated to the walker pool.