We then evaluate the generated PR implementation of Ditto on undirected graphs.
Fig. REF  shows the performance comparison with the state-of-the-art design [1]} on public graphs [2]} and synthetic graphs [1]}, where the graphs shown in the x-axis are in ascending order by their degrees.
The million traversed edges per second (MTEPS) is used as the throughput metric.
The results show that the throughput of Ditto is significantly improved and can be up to 7\(\times \)  of the existing solution.
In addition, the speedup grows up with a larger graph degree since more edges updating the same vertex causes more severe data skew.
<FIGURE>