80 citations · 111 across the 7 of their papers we have counts for
7 papers
HashMem: PIM-based Hashmap Accelerator
Akhil Shekar, Morteza Baradaran, Sabiha Tajdari +1
Hashmaps are widely utilized data structures in many applications to perform a probe on key-value pairs. However, their performance tends to degrade with the increase in the datase…
GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis
Alif Ahmed, Farzana Ahmed Siddique, Kevin Skadron
Streaming graph processing involves performing updates and analytics on a time-evolving graph. The underlying representation format largely determines the throughputs of these upda…
Deterministic vs. Non Deterministic Finite Automata in Automata Processing
Farzana Ahmed Siddique, Tommy James Tracy, Nathan Brunelle +1
Linear-time pattern matching engines have seen promising results using Finite Automata (FA) as their computation model. Among different FA variants, deterministic (DFA) and non-det…
A Roadmap for Enabling a Future-Proof In-Network Computing Data Plane Ecosystem
Daehyeok Kim, Nikita Lazarev, Tommy Tracy +7
As the vision of in-network computing becomes more mature, we see two parallel evolutionary trends. First, we see the evolution of richer, more demanding applications that require…
Tolerating Soft Errors in Processor Cores Using CLEAR (Cross-Layer Exploration for Architecting Resilience)
Eric Cheng, Shahrzad Mirkhani, Lukasz G. Szafaryn +8
We present CLEAR (Cross-Layer Exploration for Architecting Resilience), a first of its kind framework which overcomes a major challenge in the design of digital systems that are re…
CLEAR: Cross-Layer Exploration for Architecting Resilience - Combining Hardware and Software Techniques to Tolerate Soft Errors in Processor Cores
Eric Cheng, Shahrzad Mirkhani, Lukasz G. Szafaryn +8
We present a first of its kind framework which overcomes a major challenge in the design of digital systems that are resilient to reliability failures: achieve desired resilience t…
Binary Interval Search (BITS): A Scalable Algorithm for Counting Interval Intersections
Ryan M. Layer, Kevin Skadron, Gabriel Robins +2
Motivation: The comparison of diverse genomic datasets is fundamental to understanding genome biology. Researchers must explore many large datasets of genome intervals (e.g., genes…