Yang Zhou1, Jinhui He1, Hao Yang1,2,*
Journal of New Media, Vol.3, No.2, pp. 63-72, 2021, DOI:10.32604/jnm.2021.018829
Abstract In recent years, more and more attention has been paid to the research
and application of graph structure. As the most typical representative of graph
structure algorithm, breadth first search algorithm is widely used in many fields.
However, the performance of traditional serial breadth first search (BFS)
algorithm is often very low in specific areas, especially in large-scale graph
structure traversal. However, it is very common to deal with large-scale graph
structure in scientific research. At the same time, the computing performance of
supercomputer has also made great progress. China’s self-developed
supercomputer system Sunway TaihuLight (SW) has won the top… More >
Login
Register
