187 citations · 321 across the 15 of their papers we have counts for
7 papers · 1 filter
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis
Xu T. Liu, Jesun Firoz, Sinan Aksoy +5
Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitive…
A Comparative Study of Asynchronous Many-Tasking Runtimes: Cilk, Charm++, ParalleX and AM++
Abhishek Kulkarni, Andrew Lumsdaine
We evaluate and compare four contemporary and emerging runtimes for high-performance computing(HPC) applications: Cilk, Charm++, ParalleX and AM++. We compare along three bases: pr…
Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study
Thejaka Kanewala, Marcin Zalewski, Martina Barnas +1
Self-stabilizing algorithms are an important because of their robustness and guaranteed convergence. Starting from any arbitrary state, a self-stabilizing algorithm is guaranteed t…
A Survey of Methods for Collective Communication Optimization and Tuning
Udayanga Wickramasinghe, Andrew Lumsdaine
New developments in HPC technology in terms of increasing computing power on multi/many core processors, high-bandwidth memory/IO subsystems and communication interconnects, pose a…
Abstract Graph Machine
Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine
An Abstract Graph Machine(AGM) is an abstract model for distributed memory parallel stabilizing graph algorithms. A stabilizing algorithm starts from a particular initial state and…
The Anatomy of Large-Scale Distributed Graph Algorithms
Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski +2
The increasing complexity of the software/hardware stack of modern supercomputers results in explosion of parameters. The performance analysis becomes a truly experimental science,…