.png){kind=icon}
返回
Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2011.181.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
String matching requires a combination of (sometimes all) the following characteristics: high and/or predictable performance, support for large data sets and flexibility of integration and customization. This paper compares several software-based implementations of the Aho-Corasick algorithm for high-performance systems. We focus on the matching of unknown inputs streamed from a single source, typical of security applications and difficult to manage since the input cannot be preprocessed to obtain locality. We consider shared-memory architectures (Niagara 2, x86 multiprocessors, and Cray XMT) and distributed-memory architectures with homogeneous (InfiniBand cluster of x86 multicores) or heterogeneous processing elements (InfiniBand cluster of x86 multicores with NVIDIA Tesla C1060 GPUs). We describe how each solution achieves the objectives of supporting large dictionaries, sustaining high performance, and enabling customization and flexibility using various data sets.
Keyword:
Aho-Corasick
string matching
GPGPU
Cray XMT
multithreaded architectures
high-performance computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
Anomalous Temperature Dependence of the Emission Spectra of 2Cr(en)3Cl3·KCl·6H2O and Cr(en)3Cl3·3H2O
PREAI
分享收藏分享收藏
没有更多内容
没有更多内容