2 citations · 2 across the 6 of their papers we have counts for
6 papers
Skipper: Maximal Matching with a Single Pass over Edges
Mohsen Koohi Esfahani
Maximal Matching (MM) is a fundamental graph problem with diverse applications. While state-of-the-art parallel MM algorithms have a total expected work linear in number of edges,…
On Optimizing Resource Utilization in Distributed Connected Components
Mohsen Koohi Esfahani
Connected Components (CC) is a core graph problem with numerous applications. This paper investigates accelerating distributed CC by optimizing memory and network bandwidth utiliza…
Accelerating Loading WebGraphs in ParaGrapher
Mohsen Koohi Esfahani
ParaGrapher is a graph loading API and library that enables graph processing frameworks to load large-scale compressed graphs with minimal overhead. This capability accelerates the…
On Optimizing Locality of Graph Transposition on Modern Architectures
Mohsen Koohi Esfahani, Hans Vandierendonck
This paper investigates the shared-memory Graph Transposition (GT) problem, a fundamental graph algorithm that is widely used in graph analytics and scientific computing. Previous…
Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher
Mohsen Koohi Esfahani, Marco D'Antonio, Syed Ibtisam Tauhidi +2
Comprehensive evaluation is one of the basis of experimental science. In High-Performance Graph Processing, a thorough evaluation of contributions becomes more achievable by suppor…
MS-BioGraphs: Sequence Similarity Graph Datasets
Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck +2
Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, an…