11 citations · 22 across the 6 of their papers we have counts for
8 papers
The Einsum-Enabled Design Space for Graph Algorithms: A BFS Case Study
Toluwanimi O. Odemuyiwa, Serban D. Porumbescu, Muhammad Osama +2
We propose a principled approach to reasoning about various graph algorithm implementations. We leverage the extended general Einsum notation (EDGE) which allows us to factor compl…
Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers
Behrooz Zarebavami, Ahmed H. Mahmoud, Ana Dodik +5
We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while sign…
BOBA: A Parallel Lightweight Graph Reordering Algorithm with Heavyweight Implications
Matthew Drescher, Muhammad A. Awad, Serban D. Porumbescu +1
We describe a simple parallel-friendly lightweight graph reordering algorithm for COO graphs (edge lists). Our ``Batched Order By Attachment'' (BOBA) algorithm is linear in the num…
A Programming Model for GPU Load Balancing
Muhammad Osama, Serban D. Porumbescu, John D. Owens
We propose a GPU fine-grained load-balancing abstraction that decouples load balancing from work processing and aims to support both static and dynamic schedules with a programmabl…
Essentials of Parallel Graph Analytics
Muhammad Osama, Serban D. Porumbescu, John D. Owens
We identify the graph data structure, frontiers, operators, an iterative loop structure, and convergence conditions as essential components of graph analytics systems based on the…
Atos: A Task-Parallel GPU Dynamic Scheduling Framework for Dynamic Irregular Computations
Yuxin Chen, Benjamin Brock, Serban Porumbescu +3
We present Atos, a task-parallel GPU dynamic scheduling framework that is especially suited to dynamic irregular applications. Compared to the dominant Bulk Synchronous Parallel (B…