A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Accelerating Enhanced Boyer-Moore String Matching Algorithm on Multicore GPU for Network Security
2014
International Journal of Computer Applications
Preserved Fulltext
It can be also see there that multithreaded version of EBM algorithm about 12% to 13% peak performance than serial version of EBM.Speedup of EBM algorithm is grow and 12x to 13x than serial one. ...
This paper shows the results on adapting the enhanced Boyer-Moore (EBM) string matching algorithm to run on GPU paradigm and comparison with serial version and multithreaded version on CPU.The experimental ...
IMPLEMENTATION AND PERFORMANCE 3.1 Parallel Enhanced Boyer-Moore algorithm (EBM) EBM algorithm based on single-string matching BM algorithm as in [5] - [12] . ...
doi:10.5120/16973-6934
fatcat:lo7fosqsu5fv5a23r6tyfy4lwa
RaftLib
2015
Proceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Stream processing has great promise: the ability to safely exploit extreme levels of parallelism. There have been many implementations, both libraries and full languages. ...
RaftLib supports dynamic queue optimization, automatic parallelization, and real-time low overhead performance monitoring. ...
For comparison we contrast the performance of our implementations of Aho-Corasick and Boyer-Moore-Horspool against the GNU grep utility and a text matching application implemented using the Boyer-Moore ...
doi:10.1145/2712386.2712400
dblp:conf/ppopp/BeardLC15
fatcat:hwdpslbd7vgxhpsks2iugjvii4
Efficient Packet Pattern Matching for Gigabit Network Intrusion Detection Using GPUs
2012
2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an efficient GPU-based pattern matching algorithm by leveraging the computational power of GPUs to accelerate the pattern matching operations to increase the over-all processing ...
With the rapid development of network hardware technologies and network bandwidth, the high link speeds and huge amount of threats poses challenges to network intrusion detection systems, which must handle ...
These NIDS are developed based on Aho-Corasick [5] and Boyer-Moore algorithms. Coit et al. ...
doi:10.1109/hpcc.2012.235
dblp:conf/hpcc/HungLWC12
fatcat:f2qx7n4jwvhhjglpx2husbvux4
GrAVity: A Massively Parallel Antivirus Engine
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This leads to extremely high computation costs necessary to perform matching of suspicious data against those signatures. In this paper, we present GrAVity, a massively parallel antivirus engine. ...
In the ongoing arms race against malware, antivirus software is at the forefront, as one of the most important defense tools in our arsenal. ...
Giorgos Vasiliadis and Sotiris Ioannidis are also with the University of Crete. ...
doi:10.1007/978-3-642-15512-3_5
fatcat:dqxvqnie6zfytdp67thevjnt2e
Parallel DNA Sequence Approximate Matching with Multi-Length Sequence Aware Approach
2018
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
DNA sequence approximate matching is one of the main challenges in Bioinformatics. ...
Despite the evolution of new technology, there is still a need for new algorithms that accommodate the huge amount of Bioinformatics data. ...
[15] Considered the bit parallel of Boyer-Moore type for an exact pattern match. They proposed four bit parallel algorithms. ...
doi:10.5120/ijca2018916594
fatcat:kgx62oq23jd35edigufuiyvsni
Tile optimization for area in FPGA based hardware acceleration of peptide identification
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
2011
2011 6th International Conference on Industrial and Information Systems
unpublished
doi:10.1109/iciinfs.2011.6038056 fatcat:jx7w627lyzf2pjdilns2h7lq4y
doi:10.1109/iciinfs.2011.6038056 fatcat:jx7w627lyzf2pjdilns2h7lq4y
In this paper, we give a comprehensive overview of the literature on hardware acceleration of string matching algorithms, we take an FPGA hardware exploration and expedite the design time by a design automation ...
String matching algorithms can be applied for protein/gene sequence matching and with the phenomenal increase in the size of string databases to be analyzed, software implementations of these algorithms ...
Coit has proposed a string matching algorithm (software based approach) based on both Boyer Moore and Aho Corasick algorithms that can improve the performance of Snort by 1.02 to 3.32 times when comparing ...
arXiv:1403.7296v1
fatcat:gmvt2hd625amhjiqiwj4tsakbm
CUDA based Rabin-Karp Pattern Matching for Deep Packet Inspection on a Multicore GPU
2015
International Journal of Computer Network and Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a study of the improvement in efficiency of the Rabin-Karp patternmatching algorithm based Deep Packet Inspection. ...
The proposed CUDA based implementation on a multicore GPU outperforms the Intel quadcore processor and runs upto 14 times faster by executing the algorithm in parallel to search for the pattern from the ...
The Boyer-Moore algorithm is based on skipping heuristics, therefore when the suffix of the pattern appears infrequently in the Text string, the execution time can be sub-linear. ...
doi:10.5815/ijcnis.2015.10.08
fatcat:j6jlragibnc65aqeeypbyhlfqq
Configurable string matching hardware for speeding up intrusion detection
2005
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our preliminary results suggest that the hardware accelerator offers an overall system performance of up to 14Gbps. ...
A configurable string matching accelerator is developed with the focus on increasing throughput while maintaining the configurability provided by the software IDSs. ...
ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their useful comments on this paper. This work was supported by DARPA under contract F33615-03-C-410. ...
doi:10.1145/1055626.1055640
fatcat:5mmt5tkfczhvvgtgud4yjbgpve
Accelerating DNA Sequence Analysis using Intel Xeon Phi
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present an algorithm for large-scale DNA analysis that exploits thread-level and the SIMD parallelism of the Intel Xeon Phi. ...
We evaluate our approach for various numbers of cores and thread allocation affinities in the context of real-world DNA sequences of mouse, cat, dog, chicken, human and turkey. ...
Similarly, Kouzinopoulos and Margaritis [8] conducted an experiment on the Naive, KMP, Boyer-Moore-Horspool and Quick-Search string matching algorithms in the context of DNA sequencing using the CUDA ...
arXiv:1506.08612v1
fatcat:nty74rv63bhn7pkilptqj6sava
Accelerating DNA Sequence Analysis Using Intel(R) Xeon Phi(TM)
2015
2015 IEEE Trustcom/BigDataSE/ISPA
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present an algorithm for large-scale DNA analysis that exploits thread-level and the SIMD parallelism of the Intel Xeon Phi. ...
We evaluate our approach for various numbers of cores and thread allocation affinities in the context of real-world DNA sequences of mouse, cat, dog, chicken, human and turkey. ...
Similarly, Kouzinopoulos and Margaritis [8] conducted an experiment on the Naive, KMP, Boyer-Moore-Horspool and Quick-Search string matching algorithms in the context of DNA sequencing using the CUDA ...
doi:10.1109/trustcom.2015.636
dblp:conf/trustcom/MemetiP15
fatcat:g6j3djqts5f2ret6x7y3xgikea
SIMD Implementation of the Aho-Corasick Algorithm using Intel AVX2
2019
Scalable Computing : Practice and Experience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The AC algorithm is in the heart of many applications including digital forensics such as digital signatures demonstrating the authenticity of a digital message or document, full text search (utility programs ...
In this paper we present a vectorized version of the AC algorithm designed with the use of packed instructions based on the Intel streaming SIMD (Single Instruction Multiple Data) extensions AVX2 (Advanced ...
The Commentz-Walter algorithm [6] is a suffix-based, exact multiple string matching solution that combines the concepts of Boyer-Moore and AC algorithms. ...
doi:10.12694/scpe.v20i3.1572
fatcat:5jxogapbjfdhnhmr37xlwzcavi
A hardware approach to protein identification
2015
2015 IEEE Biomedical Circuits and Systems Conference (BioCAS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
When performing this task with General Purpose Processors (GPPs), as it might be in a large scale installation (such as medical or research centers), this long execution time translates into a high energy ...
At the basis of proteins identification we have a string matching algorithm, which has a computational complexity that scales with the length of both the searched and the reference string. ...
performs the string matching analyzing a small number of peptides in parallel. ...
doi:10.1109/biocas.2015.7348382
dblp:conf/biocas/BianchiCDS15
fatcat:fyx4yug4fbcuzdtjt547yfpsxy
Parallel String Matching Problems with Computing Models An Analysis of the Most Recent Studies
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities. ...
We present the performance of the different algorithms and their effectiveness. Finally this analysis helps the researchers to develop the better technique. ...
For bigger pattern sizes string matching is more easier for Boyer moore algorithm because of less number of mismatches. ...
doi:10.5120/13321-0738
fatcat:ca3hjbzpxrc2rgjn7tjmhca4ni
Pattern matching of signature-based IDS using Myers algorithm under MapReduce framework
2017
EURASIP Journal on Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This research intends to accelerate the pattern matching operation through parallelizing a matching algorithm on a multi-core CPU. ...
In this paper, we parallelize a bit-vector algorithm, Myers algorithm, on a multi-core CPU under the MapReduce framework. ...
Acknowledgements We would like to acknowledge the efforts of Yaser Jararweh and the valuable feedback of the reviewers.
Availability of data and material Not applicable. ...
doi:10.1186/s13635-017-0062-7
fatcat:nmpetehk2jgyvdmkwcshhy4b2u
String Matching with Multicore CPUs: Performing Better with the Aho-Corasick Algorithm
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
2013
2013 IEEE 8th International Conference on Industrial and Information Systems
unpublished
doi:10.1109/iciinfs.2013.6731987 fatcat:zdykihn5ijbfdk2dum46jglvnu
doi:10.1109/iciinfs.2013.6731987 fatcat:zdykihn5ijbfdk2dum46jglvnu
Multicore architectures are capable of providing better performance by parallelizing the multiple string matching algorithms. ...
The focus of this paper is the acceleration of Aho-Corasick algorithm through a multicore CPU based software implementation. ...
Because, one research group [10] implemented (Knuth-Morris-Pratt, Boyer-Moore, Aho-Corasick, and Commentz-Walter algorithms directly from the abstract algorithms derived and presented in [11] ) and ...
arXiv:1403.1305v1
fatcat:dsbvh6hvunakdbi6y7genvokwy
« Previous
Showing results 1 — 15 out of 382 results