25 citations · 28 across the 7 of their papers we have counts for
9 papers
Faster Vertex Cover Algorithms on GPUs with Component-Aware Parallel Branching
Hussein Amro, Basel Fakhri, Amer E. Mouawad +1
Algorithms for finding minimum or bounded vertex covers in graphs use a branch-and-reduce strategy, which involves exploring a highly imbalanced search tree. Prior GPU solutions as…
Low-latency control system for feedback experiments with optical tweezer arrays
Amir H. Dadpour, Timur Khayrullin, Fouad Afiouni +4
We present and characterize a modular, open-source system to perform feedback control experiments on configurations of atoms and molecules in arrays of optical tweezers. The system…
Efficient algorithms to solve atom reconfiguration problems. III. The bird and batching algorithms and other parallel implementations on GPUs
Fouad Afiouni, Remy El Sabeh, Naomi Nishimura +3
We present efficient implementations of atom reconfiguration algorithms for both CPUs and GPUs, along with a batching routine to merge displacement operations for parallel executio…
Predicting the Performance-Cost Trade-off of Applications Across Multiple Systems
Amir Nassereldine, Safaa Diab, Mohammed Baydoun +4
In modern computing environments, users may have multiple systems accessible to them such as local clusters, private clouds, or public clouds. This abundance of choices makes it di…
A Framework for High-throughput Sequence Alignment using Real Processing-in-Memory Systems
Safaa Diab, Amir Nassereldine, Mohammed Alser +3
Sequence alignment is a memory bound computation whose performance in modern systems is limited by the memory bandwidth bottleneck. Processing-in-memory architectures alleviate thi…
High-throughput Pairwise Alignment with the Wavefront Algorithm using Processing-in-Memory
Safaa Diab, Amir Nassereldine, Mohammed Alser +3
We show that the wavefront algorithm can achieve higher pairwise read alignment throughput on a UPMEM PIM system than on a server-grade multi-threaded CPU system.
Parallel Vertex Cover Algorithms on GPUs
Peter Yamout, Karim Barada, Adnan Jaljuli +2
Finding small vertex covers in a graph has applications in numerous domains. Two common formulations of the problem include: Minimum Vertex Cover, which finds the smallest vertex c…
A Compiler Framework for Optimizing Dynamic Parallelism on GPUs
Mhd Ghaith Olabi, Juan Gómez Luna, Onur Mutlu +2
Dynamic parallelism on GPUs allows GPU threads to dynamically launch other GPU threads. It is useful in applications with nested parallelism, particularly where the amount of neste…
PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inference
Aayush Ankit, Izzat El Hajj, Sai Rahul Chalamalasetti +8
Memristor crossbars are circuits capable of performing analog matrix-vector multiplications, overcoming the fundamental energy efficiency limitations of digital logic. They have be…