An Efficient Approach to Vectorize the Hybrid Breadth-First Search
2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)（2020）
摘要
Graph, as a powerful data structure, is widely used in numerous applications. Among plenty of algorithms in graph analysis, Breadth-First Search (BFS) is one of the most basic and important kernels. As the size of the graph increases rapidly, how to speed up the processing remains a meaningful task. Meanwhile, modern processors are commonly equipped with vectorization (Single Instruction Multiple ...
更多查看译文
关键词
Instruction sets,High performance computing,Conferences,Data structures,Acceleration,Task analysis,Kernel
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要