可扩展性
计算机科学
分类器(UML)
字符串搜索算法
算法
并行计算
理论计算机科学
人工智能
模式匹配
数据库
作者
Marcel Khalifa,Barak Hoffer,Orian Leitersdorf,Robert Hanhan,Ben Perach,Leonid Yavits,Shahar Kvatinsky
标识
DOI:10.1109/tvlsi.2023.3293038
摘要
Deoxyribonucleic acid (DNA) sequence classification is a fundamental task in computational biology with vast implications for applications such as disease prevention and drug design. Therefore, fast high-quality sequence classifiers are significantly important. This article introduces ClaPIM, a scalable DNA sequence classification architecture based on the emerging concept of hybrid in-crossbar and near-crossbar memristive processing-in-memory (PIM). We enable efficient and high-quality classification by uniting the filter and search stages within a single algorithm. Specifically, we propose a custom filtering technique that drastically narrows the search space and a search approach that facilitates approximate string matching through a distance function. ClaPIM is the first PIM architecture for scalable approximate string matching that benefits from the high density of memristive crossbar arrays and the massive computational parallelism of PIM. Compared with Kraken2, a state-of-the-art software classifier, ClaPIM provides significantly higher classification quality (up to $20 \times $ improvement in F1 score) and also demonstrates a $1.8 \times $ throughput improvement. Compared with edit distance tolerant approximate matching (EDAM), a recently proposed static random-access memory (SRAM)-based accelerator that is restricted to small datasets, we observe both a $30.4 \times $ improvement in normalized throughput per area and a 7% increase in classification precision.
科研通智能强力驱动
Strongly Powered by AbleSci AI