Method of workload balancing in GPU implementation of breadth-first search

Optimized version of the parallel breadth-first search algorithm is considered in the paper. An optimization method described in the paper allows reducing the overhead of the suggested algorithm on each its iteration. It is shown that the optimized parallel algorithm for GPU is more than five times faster than its sequential analog on CPU.