50 citations · 87 across the 8 of their papers we have counts for
8 papers
SimplePIM: A Software Framework for Productive and Efficient Processing-in-Memory
Jinfan Chen, Juan Gómez-Luna, Izzat El Hajj +2
Data movement between memory and processors is a major bottleneck in modern computing systems. The processing-in-memory (PIM) paradigm aims to alleviate this bottleneck by performi…
Asynchronous Persistence with ASAP
Ahmed Abulila, Izzat El Hajj, Myoungsoo Jung +1
Supporting atomic durability of updates for persistent memories is typically achieved with Write-Ahead Logging (WAL). WAL flushes log entries to persistent memory before making the…
Efficient algorithms to solve atom reconfiguration problems. II. The assignment-rerouting-ordering (aro) algorithm
Remy El Sabeh, Jessica Bohm, Zhiqian Ding +5
Programmable arrays of optical traps enable the assembly of configurations of single atoms to perform controlled experiments on quantum many-body systems. Finding the sequence of c…
Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm
Barry Cimring, Remy El Sabeh, Marc Bacvanski +5
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics…
Parallelizing Maximal Clique Enumeration on GPUs
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj +3
We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing MCE o…
Benchmarking Memory-Centric Computing Systems: Analysis of Real Processing-in-Memory Hardware
Juan Gómez-Luna, Izzat El Hajj, Ivan Fernandez +3
Many modern workloads such as neural network inference and graph processing are fundamentally memory-bound. For such workloads, data movement between memory and CPU cores imposes a…
Benchmarking a New Paradigm: An Experimental Analysis of a Real Processing-in-Memory Architecture
Juan Gómez-Luna, Izzat El Hajj, Ivan Fernandez +3
Many modern workloads, such as neural networks, databases, and graph processing, are fundamentally memory-bound. For such workloads, the data movement between main memory and CPU c…
Parallel K-Clique Counting on GPUs
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi +2
Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically d…