一种基于高通量计算机的图算法优化技术

A Graph Algorithm Optimization Technique Based on High-throughput Computer

随着互联网技术在各个领域的快速发展,出现了各种各样的图数据,如何快速处理这些图数据成为学术界的一个焦点.横向优先搜索算法(缩写为BFS)是从根节点开始,沿着树的宽度遍历树的节点,如果所有节点均被访问,则算法中止.基于此,本文介绍的优化高通量计算机具有功耗低、冗余访存时间短等特点.

With the rapid development of Internet technology in various fields,there are a variety of graph data.How to quickly process these graph data has become a focus o£academic circles.Horizontal first search algorithm(abbreviated as BFS)starts from the root node and traverses the nodes along the width of the tree.If all nodes are accessed,the algorithm stops.Based on this,the optimized high-throughput computer introduced in this paper has the characteristics of low power consumption and short redundant memory access time.