George M. Slota

Prof. George M. Slota


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
GSGeorge M. Slota
George M. Slota
CRCameron Root
Cameron Root
KDKaren Devine
Karen Devine
KMKamesh Madduri
Kamesh Madduri
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
We introduce XtraPuLP, a distributed-memory graph partitioner designed to process irregular trillion-edge graphs. XtraPuLP is based on the scalable label propagation community detection technique, which has been demonstrated in various prior works as a viable means to produce high quality partitions of skewed and small-world graphs with minimal computation time. Our XtraPuLP implementation can also be generalized to compute partitions with an arbitrary number of constraints, and it can compute partitions with balanced communication load across all parts. On a collection of large sparse graphs, we show that XtraPuLP partitioning is considerably faster than state-of-the-art partitioning methods, while also demonstrating that XtraPuLP can produce partitions of real-world graphs with billion+ vertices and over a hundred billion edges in minutes. Additionally, we demonstrate XtraPuLP on a variety of applications, including large-scale graph analytics and sparse matrix-vector multiplication.

5 February 2022 in Parallel Computing
Verified
Journal Article
Closed access
IBIan Bogle
Ian Bogle
GSGeorge M. Slota
George M. Slota
EBErik G. Boman
Erik G. Boman
KDKaren D. Devine
Karen D. Devine
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam

6 November 2024
Verified
Conference Paper
Open access
YZYuxuan Zhu
Yuxuan Zhu
MMMichael Mandulak
Michael Mandulak
KWKerui Wu
Kerui Wu
GSGeorge M. Slota
George M. Slota
YJYuseok Jeon
Yuseok Jeon
LYLei Yu
Lei Yu
Graph Neural Networks (GNNs) have been shown to be susceptible to backdoor poisoning attacks, which pose serious threats to real-world applications. Meanwhile, graph reduction techniques have recently emerged as effective methods for accelerating GNN training on large-scale graphs. However, the development of graph reduction techniques for large graphs does not yet address how these methods might interact with the potential risks of data poisoning attacks against GNNs, particularly in relation to existing backdoor attacks. This paper conducts a thorough examination of the robustness of graph reduction methods in scalable GNN training in the presence of state-of-the-art backdoor attacks. We performed a comprehensive robustness analysis across six coarsening methods and six sparsification methods for graph reduction, under three GNN backdoor attacks against three GNN architectures. Our findings indicate that the effectiveness of graph reduction methods in mitigating attack success rates varies significantly, with some methods even exacerbating the attacks. Through detailed analyses of triggers and poisoned nodes, we interpret our findings and enhance our understanding of how graph reduction influences robustness against backdoor attacks. These results highlight the critical need for incorporating robustness considerations in graph reduction for scalable GNN training.

26 January 2023
Verified
Book Chapter
Closed access
PDF file
CBChristopher Brissette
Christopher Brissette
DLDavid Liu
David Liu
GSGeorge M. Slota
George M. Slota

29 February 2024
Verified
Book Chapter
Closed access
PDF file
CBChristopher Brissette
Christopher Brissette
UPUjwal Pandey
Ujwal Pandey
GSGeorge M. Slota
George M. Slota

11 April 2025
Verified
Book Chapter
Closed access
PDF file
CBChristopher Brissette
Christopher Brissette
WHWilliam Hawkins
William Hawkins
GSGeorge M. Slota
George M. Slota