Name
Abstract | ||
|---|---|---|
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 ... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/HPCC-SmartCity-DSS50907.2020.00066 | 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) |
Keywords | DocType | ISBN |
Instruction sets,High performance computing,Conferences,Data structures,Acceleration,Task analysis,Kernel | Conference | 978-1-7281-7649-9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chi Zhu | 1 | 92 | 19.81 |
| Weixuan Shi | 2 | 0 | 0.34 |
| Zhiguang Chen | 3 | 8 | 7.25 |
| Nong Xiao | 4 | 649 | 116.15 |
| Yutong Lu | 5 | 307 | 53.61 |