The world is in the midst of an unprecedented growth of interconnected data, and graph processing systems are expected to play a vital role. Conventional graph algorithms designed for static graphs struggle to efficiently handle the continuous changes and updates that occur within these networks. As these networks grow in complexity, the need for algorithms capable of efficiently analyzing dynamic graph data is increasingly crucial. Our research aims to address the computational challenges posed by the need for real-time insights and scalable processing in dynamic and complex networks.
However, many dynamic algorithms are sequential, tailored towards web graphs, do not utilize reducibility, locality benefits of SCCs, overestimate affected vertices, and have high overhead, implementations are not well optimized, do not take advantage of auxiliary information, and do not gracefully tolerate soft-faults which modern architectures introduce. Our dynamic approaches for PageRank and community detection address these issues. Our work has been accepted by IPDPS workshops (3), the Euro-Par conference (1), the ICPP conference (1), and the Complex Networks conference (1). Key outputs from our work include the design of a common framework for dynamic graph algorithms, and techniques to address soft faults in dynamic algorithms.
- 📰 A Fast Parallel Approach for Neighborhood-based Link Prediction by Disregarding Large Hubs (Concurrency and Computation: Practice and Experience 2024, Wiley)
- 📰 Parallel Multicore Algorithms for Community Detection in Dynamic Graphs (Accepted in International Journal of Networking and Computing 2024)
- 📰 Dynamic Batch Parallel Algorithms for Updating PageRank (IPDPSW ParSocial 2022, IEEE)
- 📰 Shared-Memory Parallel Algorithms for Community Detection in Dynamic Graphs (Outstanding paper, IPDPSW ADPCM 2024, IEEE)
- 📰 Lock-free Computation of PageRank in Dynamic Graphs (IPDPSW ParSocial 2024, IEEE)
- 📰 Fast Leiden Algorithm for Community Detection in Shared Memory Setting (ICPP 2024, ACM)
- 📰 DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs (Euro-Par 2024, Springer LNCS)
- 📰 High-Speed Neighborhood-based Link Prediction by Disregarding Large Hubs (Euro-Par 2024 PhD Symposium, Springer LNCS)
- 📰 GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) formats (Euro-Par AMTE 2024, Springer LNCS)
- 📰 GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting (Euro-Par HiPES 2024, Springer LNCS)
- 📰 High-Performance Implementation of Louvain Algorithm with Representational Optimizations (Complex Networks 2024, Springer SCI)
- 📰 Shared-Memory Parallel Dynamic Louvain Algorithm for Community Detection (IPDPS Poster 2024, IEEE)
- 📰 EvolvGraph: A Tool for Property-Constrained Generation of Dynamic Graphs (HiPC 2024 SRS, IEEE)
- 📰 Memory Efficient GPU-based LPA for Community Detection on Large Graphs
- 📰 ν-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection
- 📰 Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches
- 📰 Heuristic-based Dynamic Leiden ... Efficient Tracking of Communities on Evolving Graphs
- 📰 A Starting Point for Dynamic Community Detection with Leiden Algorithm
- 📰 DF Louvain: Fast Incrementally Expanding Approach for ... on Dynamic Graphs
- 📰 An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs
- 📰 GSL-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection with no ...
- 📰 An Approach for Addressing Internally-Disconnected Communities in Louvain Algorithm
- 📰 Heuristics for Inequality minimization in PageRank values
- 📰 Enhancing Efficiency in Parallel Louvain Algorithm for Community Detection
- 📰 Effect of stepwise adjustment of Damping factor upon PageRank
- 📰 STIC-D based Algorithmic Optimizations for Monolithic PageRank
- 📰 Adjusting Datatype of Rank vector and CSR Representation with PageRank
- 📰 Parallelizing PageRank for a Volta GPU
- 📰 Dead End handling strategies for PageRank algorithm
- 📰 Rank adjustment strategies for Dynamic PageRank
- 📰 Effect of stepwise adjustment of Damping factor upon PageRank
- 📰 Adjusting PageRank parameters and Comparing results
- 📰 Understand Problems
- 📓 Parallel Dynamic Graph Algorithms for Social Networks (Thesis Proposal Slides)
- 📓 Exploring Parallel Optimizations for Dynamic Graph Algorithms
- 📓 Exploring Optimizations for Dynamic Graph Algorithms on the GPU
- 📓 Design ... of a heterogeneous sensor-based embedded system for flood management (2014)
- 📝 List of Research papers: Prof. Kishore Kothapalli, CSTAR, IIIT Hyderabad
- 📜 Submitting the Thesis Evaluation Request by MS/PhD Students (IIIT Hyderabad)
- 📜 The Purpose and Process of PhD Comprehensive VIVA Examination (IIIT Hyderabad)
- 📜 Policy on stipend support for research students (IIIT Hyderabad)
- 📜 Top CSE conferences list (IIIT Hyderabad)
- 📜 Proceedings Scholar Metrics
- 📜 "You and Your Research" by Richard W Hamming
- 👨🏫 Top Researchers in High Performance Computing
- 📰 Top Research Papers in High Performance Computing
- 🎃 Top Conferences in High Performance Computing
- 📚 Top Journals in High Performance Computing
- 📰 Top Products in High Performance Computing
- 💵 Travel Grant for Conferences: Mayank Tripathi
- 🧵 List of Available Datasets
- 🧪 List of Experiments
- 📰 Research Notes