Leonid Yavits

Leonid Yavits

Auto-generated profile, based on publicly available information

Leonid Yavits

EnICS Labs, Faculty of Engineering, Bar-Ilan University, Ramat-Gan, Israel

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2022 in IEEE Access
Verified
Journal Article
Open access
Esteban GarzónEsteban Garzón
Esteban Garzón
RGRoman Golman
Roman Golman
ZJZuher Jahshan
Zuher Jahshan
RHRobert Hanhan
Robert Hanhan
NVNatan Vinshtok-Melnik
Natan Vinshtok-Melnik
LYLeonid Yavits
Leonid Yavits
This paper proposes a novel Hamming distance tolerant content-addressable memory (HD-CAM) for energy-efficient in-memory approximate matching applications. HD-CAM exploits NOR-type based static associative memory bitcells, where we add circuitry to enable approximate search with programmable tolerance. HD-CAM implements approximate search using matchline charge redistribution rather than its rise or fall time, frequently employed in state-of-the-art solutions. HD-CAM was designed in a 65 $\mathrm { \text {n} \text {m} }$ 1.2 $\mathrm { \text {V}}$ CMOS technology and evaluated through extensive Monte Carlo simulations. Our analysis shows that HD-CAM supports robust operation under significant process variations and changes in the design parameters, enabling a wide range of mismatch threshold (tolerable Hamming distance) levels and pattern lengths. HD-CAM was functionally evaluated for virus DNA classification, which makes HD-CAM suitable for hardware acceleration of genomic surveillance of viral outbreaks, such as Covid-19 pandemics.

8 February 2023 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Open access
Esteban GarzónEsteban Garzón
Esteban Garzón
MLMarco Lanuzza
Marco Lanuzza
ATAdam Teman
Adam Teman
LYLeonid Yavits
Leonid Yavits
In-memory computing seeks to minimize data movement and alleviate the memory wall by computing in-situ , in the same place that the data is located. One of the key emerging technologies that promises to enable such computing-in-memory is spin-transfer torque magnetic tunnel junction (STT-MTJ). This paper proposes AM 4 , a combined STT-MTJ-based Content Addressable Memory (CAM), Ternary CAM (TCAM), approximate matching (similarity search) CAM (ACAM), and in-memory Associative Processor (AP) design, inspired by the recently announced Samsung MRAM crossbar. We demonstrate and evaluate the performance and energy-efficiency of the AM 4 -based AP using a variety of data intensive workloads. We show that an AM 4 -based AP outperforms state-of-the-art solutions both in performance (with the average speedup of about 10×) and energy-efficiency (by about 60× on average).

11 March 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
LYLeonid Yavits
Leonid Yavits
RKRoman Kaplan
Roman Kaplan
RGRan Ginosar
Ran Ginosar
GIRAF is a General purpose In-storage Resistive Associative Framework based on resistive content addressable memory (RCAM), which functions simultaneously as a storage and a massively parallel associative processor. GIRAF alleviates the bandwidth wall by connecting every memory bit to processing transistors and keeping computing inside the storage arrays, thus implementing deep in-data, rather than near-data, processing. We show that GIRAF outperformed a reference computer architecture with a bandwidth-limited external storage access on a variety of data-intensive workloads. The performance of GIRAF Dot Product and Sparse Matrix-Vector multiplication exceeds the attainable performance of a reference architecture by 1200 × and 130 ×, respectively.

28 December 2018 in IEEE Micro
Verified
Journal Article
Closed access
RKRoman Kaplan
Roman Kaplan
LYLeonid Yavits
Leonid Yavits
RGRan Ginosar
Ran Ginosar
DNA read mapping is a computationally expensive bioinformatics task, required for genome assembly and consensus polishing. It requires to find the best-fitting location for each DNA read on a long reference sequence. A novel resistive approximate similarity search accelerator, RASSA, exploits charge distribution and parallel in-memory processing to reflect a mismatch count between DNA sequences. RASSA implementation of DNA long read pre-alignment outperforms the state-of-art solution, minimap2, by 16-77x with comparable accuracy and provides two orders of magnitude higher throughput than GateKeeper, a short-read pre-alignment hardware architecture implemented in FPGA.

30 January 2018 in IEEE Transactions on Nanotechnology
Verified
Journal Article
Closed access
RKRoman Kaplan
Roman Kaplan
LYLeonid Yavits
Leonid Yavits
RGRan Ginosar
Ran Ginosar
Machine learning algorithms have become a major tool in various applications. The high performance requirements on large-scale datasets pose a challenge for traditional von Neumann architectures. We present two machine learning implementations and evaluations on PRINS, a novel processing-in-storage system based on Resistive Content Addressable Memory (ReCAM). PRINS functions simultaneously as a storage and a massively parallel associative processor. PRINS processing-in-storage resolves the bandwidth wall faced by near-data von Neumann architectures, such as 3D DRAM and CPU stack or SSD with embedded CPU, by keeping the computing inside the storage arrays, thus implementing in-data, rather than near-data, processing. We show that PRINS based processing-in-storage architecture may outperform existing in-storage designs and accelerator based designs. Multiple performance comparisons for the ReCAM processing-in-storage implementations of K-means and K-nearest neighbors are performed. Compared platforms include CPU, GPU, FPGA and Automata Processor. We show that PRINS may achieve an order-of-magnitude speedup and improved power efficiency relative to all compared platforms.

14 July 2022 in IEEE Micro
Verified
Journal Article
Closed access
Esteban GarzónEsteban Garzón
Esteban Garzón
ATAdam Teman
Adam Teman
MLMarco Lanuzza
Marco Lanuzza
LYLeonid Yavits
Leonid Yavits
This work presents AIDA, an associative in-memory deep learning processor for edge devices. An associative processor is a massively parallel non-von Neumann accelerator that uses memory cells for computing; the bulk of data is never transferred outside the memory arrays for external processing. AIDA utilizes a dynamic content addressable memory for both data storage and processing, and benefits from sparsity and limited arithmetic precision, typical in modern deep neural networks (DNNs). The novel in-data processing implementation designed for the AIDA accelerator achieves a speedup of 270× over an advanced CPU at more than three orders-of-magnitude better energy efficiency.