51 citations · 190 across the 18 of their papers we have counts for
7 papers · 1 filter
TRUST: Triangle Counting Reloaded on GPUs
Santosh Pandey, Zhibin Wang, Sheng Zhong +8
Triangle counting is a building block for a wide range of graph applications. Traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric tr…
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations
Emmanuel Agullo, Mirco Altenbernd, Hartwig Anzt +33
This work is based on the seminar titled ``Resiliency in Numerical Algorithm Design for Extreme Scale Simulations'' held March 1-6, 2020 at Schloss Dagstuhl, that was attended by a…
C-SAW: A Framework for Graph Sampling and Random Walk on GPUs
Santosh Pandey, Lingda Li, Adolfy Hoisie +2
Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing…
GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs
Anil Gaihre, Xiaoye S. Li, Hang Liu
Decomposing matrix A into a lower matrix L and an upper matrix U, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matri…
Distributed macroscopic traffic simulation with Open Traffic Models
Gabriel Gomes, Juliette Ugirumurera, Xiaoye Li
This paper presents OTM-MPI, an extension of the Open Traffic Models platform (OTM) for running macroscopic traffic simulations in high-performance computing environments. Macrosco…
A unified software framework for solving traffic assignment problems
Juliette Ugirumurera, Gabriel Gomes, Emily Porter +2
We describe a software framework for solving user equilibrium traffic assignment problems. The design is based on the formulation of the problem as a variational inequality. The so…
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
Ariful Azad, Aydın Buluc, Xiaoye S. Li +2
We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted bipartite graph such that weights on the edges of the matching are large. This…