TY - GEN
T1 - Arachne
T2 - 2022 IEEE High Performance Extreme Computing Conference, HPEC 2022
AU - Rodriguez, Oliver Alvarado
AU - Du, Zhihui
AU - Patchett, Joseph
AU - Li, Fuhuan
AU - Bader, David A.
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Due to the emergence of massive real-world graphs, whose sizes may extend to terabytes, new tools must be developed to enable data scientists to handle such graphs efficiently. These graphs may include social networks, computer networks, and genomes. In this paper, we propose a novel graph package Arachne to make large-scale graph analytics more effortless and more efficient based on the open-source Arkouda framework, which has been developed to allow users to perform massively parallel computations on distributed data with an interface similar to NumPy. In this package, we developed a fundamental sparse graph data structure and several useful graph algorithms around our data structure to build a basic algorithmic library. Benchmarks and tools have also been developed to evaluate and demonstrate the provided graph algorithms. The graph algorithms we have implemented thus far include breadth-first search (BFS), connected components (CC), k-Truss (KT), Jaccard coefficients (JC), triangle counting (TC), and triangle centrality (TCE). Their corresponding experimental results based on realworld and synthetic graphs are presented.
AB - Due to the emergence of massive real-world graphs, whose sizes may extend to terabytes, new tools must be developed to enable data scientists to handle such graphs efficiently. These graphs may include social networks, computer networks, and genomes. In this paper, we propose a novel graph package Arachne to make large-scale graph analytics more effortless and more efficient based on the open-source Arkouda framework, which has been developed to allow users to perform massively parallel computations on distributed data with an interface similar to NumPy. In this package, we developed a fundamental sparse graph data structure and several useful graph algorithms around our data structure to build a basic algorithmic library. Benchmarks and tools have also been developed to evaluate and demonstrate the provided graph algorithms. The graph algorithms we have implemented thus far include breadth-first search (BFS), connected components (CC), k-Truss (KT), Jaccard coefficients (JC), triangle counting (TC), and triangle centrality (TCE). Their corresponding experimental results based on realworld and synthetic graphs are presented.
KW - graph analytics
KW - large-scale data
KW - open-source framework
KW - parallel algorithm
UR - http://www.scopus.com/inward/record.url?scp=85145019373&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85145019373&partnerID=8YFLogxK
U2 - 10.1109/HPEC55821.2022.9991947
DO - 10.1109/HPEC55821.2022.9991947
M3 - Conference contribution
AN - SCOPUS:85145019373
T3 - 2022 IEEE High Performance Extreme Computing Conference, HPEC 2022
BT - 2022 IEEE High Performance Extreme Computing Conference, HPEC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 19 September 2022 through 23 September 2022
ER -