Skip to Content

George Slota

Massively Parallel Graph Analytics

(jrn)
Jul 2014 - Aug 2016

2020

George M. Slota, Cameron Root, Karen Devine, Kamesh Madduri, and Sivasankaran Rajamanickam (2020): Scalable, Multi-Constraint, Complex-Objective Graph Partitioning, IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical & Electronics Engineers, Vol 31, Num 12, pp2789-2801

2017

George M. Slota, Sivasankaran Rajamanickam, and Kamesh Madduri (2017): Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations, Institute of Electrical & Electronics Engineers, 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp588-597, Lake Buena Vista, Florida, U.S.A.
George M. Slota, Sivasankaran Rajamanickam; Karen Devine; and Kamesh Madduri (2017): Partitioning Trillion-Edge Graphs in Minutes, Institute of Electrical & Electronics Engineers, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp646-655, Orlando, Florida, U.S.A.

2016

George M. Slota, Sivasankaran Rajamanickam, and Kamesh Madduri (2016): A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization, Institute of Electrical & Electronics Engineers, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp293-302, Chicago, Illinois, U.S.A.
George M. Slota, Kamesh Madduri, and Sivasankaran Rajamanickam (2016): Complex Network Partitioning Using Label Propagation, SIAM Journal on Scientific Computing, Society for Industrial & Applied Mathematics, Vol 38, Num 5, ppS620-S645

2015

George M. Slota and Kamesh Madduri (2015): Parallel Color-Coding, Parallel Computing, Elsevier BV, Vol 47, pp51-69
George M. Slota, Sivasankaran Rajamanickam, and Kamesh Madduri (2015): High-Performance Graph Analytics on Manycore Processors, Institute of Electrical & Electronics Engineers, 2015 IEEE International Parallel and Distributed Processing Symposium, pp17-27, Hyderabad, India

2016

George Slota (2016): Processing Trillion Edge Graphs in Distributed Memory, 2016 Blue Waters Annual Report, pp282-283

George Slota: Extreme-scale Graph Analysis on Blue Waters


Blue Waters Symposium 2016, Jun 14, 2016

George Slota: Parallel Graph Algorithms on Modern Systems


29th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2015); Hyderabad, India, May 26, 2015

George M. Slota: Massively Parallel Graph Analytics


Blue Waters Symposium 2015, May 12, 2015

Extreme-scale Graph Analysis on Blue Waters


Aug 27, 2016

In this video from the 2016 Blue Waters Symposium, George Slota from Pennsylvania State University presents: Extreme-scale Graph Analysis on Blue Waters.


Sources:
 

Four additional students named Blue Waters Graduate Fellows


Jul 7, 2014

Four additional computational science PhD students have been selected to receive Blue Waters Graduate Fellowships, which provide graduate students in diverse fields with substantial support and the opportunity to leverage the petascale power of NCSA’s Blue Waters supercomputer to advance their research. Six graduate fellows were named earlier this spring. Because of the large number of qualified applicants, NCSA sought and was awarded additional fellowship funding from the National Science Foundation, enabling the Blue Waters project to support a total of 10 graduate fellows.


Sources: