Graph Processing, Gpu Computing, Graph Analytics, Graph Computing.
efficient algorithms on CPUs. To navigate this trade-off, we introduce the concept of an update window, denoted as w. w serve as a soft adjustable threshold value to balance the efficiency and parallelism. In each iteration round, only vertices with distances falling within the update window are