Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Hajj, Izzat El"'
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 performing computation inside memory chips. Real PIM hardware (e.g., the UPMEM
Externí odkaz:
http://arxiv.org/abs/2310.01893
Autor:
Nassereldine, Amir, Diab, Safaa, Baydoun, Mohammed, Leach, Kenneth, Alt, Maxim, Milojicic, Dejan, Hajj, Izzat El
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 difficult for users to select the system and configuration for running a
Externí odkaz:
http://arxiv.org/abs/2304.01676
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 actual data persistent to ensure that a consistent state can be recov
Externí odkaz:
http://arxiv.org/abs/2302.13394
Autor:
Sabeh, Remy El, Bohm, Jessica, Ding, Zhiqian, Maaz, Stephanie, Nishimura, Naomi, Hajj, Izzat El, Mouawad, Amer E., Cooper, Alexandre
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 control operations to transform an arbitrary configuration of atoms int
Externí odkaz:
http://arxiv.org/abs/2212.05586
Autor:
Cimring, Barry, Sabeh, Remy El, Bacvanski, Marc, Maaz, Stephanie, Hajj, Izzat El, Nishimura, Naomi, Mouawad, Amer E., Cooper, Alexandre
We propose the redistribution-reconfiguration~(red-rec) algorithm to efficiently compute control protocols to assemble compact-centered configurations of atoms in two-dimensional arrays of optical traps with lattice geometries. The red-rec algorithm
Externí odkaz:
http://arxiv.org/abs/2212.03885
Autor:
Almasri, Mohammad, Chang, Yen-Hsiang, Hajj, Izzat El, Nagi, Rakesh, Xiong, Jinjun, Hwu, Wen-mei
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 on GPUs perform a breadth-first traversal of the tree, which has limite
Externí odkaz:
http://arxiv.org/abs/2212.01473
Autor:
Diab, Safaa, Nassereldine, Amir, Alser, Mohammed, Gómez-Luna, Juan, Mutlu, Onur, Hajj, Izzat El
Sequence alignment is a memory bound computation whose performance in modern systems is limited by the memory bandwidth bottleneck. Processing-in-memory architectures alleviate this bottleneck by providing the memory with computing competencies. We p
Externí odkaz:
http://arxiv.org/abs/2208.01243
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 cover in a graph, and Parameterized Vertex Cover, which finds a vertex
Externí odkaz:
http://arxiv.org/abs/2204.10402
Autor:
Diab, Safaa, Nassereldine, Amir, Alser, Mohammed, Luna, Juan Gómez, Mutlu, Onur, Hajj, Izzat El
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.
Externí odkaz:
http://arxiv.org/abs/2204.02085
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 nested parallelism is irregular and cannot be predicted beforehand. However
Externí odkaz:
http://arxiv.org/abs/2201.02789