M. GÓNGORA-BLANDÓN, M. VARGA S-LOMBARDO
Copyright © 2012 SciRes. JIS
318
using GPU technology. We can state that in the next
years the high performance application development us-
ing GPU will increase, displacing CPU eventually.
REFERENCES
[1] S. Tomov, J. Dongarra and M. Baboulin, “Towards Dense
Linear Algebra for Hybrid GPU Accelerated Manycore
Systems,” Parallel Computing, Vol. 36, No. 5-6, 2010, pp.
232-240. doi:10.1016/j.parco.2009.12.005
[2] NVIDIA, “What Is GPU Computing,” 2012.
http://www.nvidia.com/object/what-is-gpu-computing.ht
ml
[3] D. Gusfield, “Algorithms on Strings, Trees, and Sequences:
Computer Science and Computational Biology,” Cam-
bridge University, Cambridge, 1997.
doi:10.1017/CBO9780511574931
[4] G. Vasiliadis, S. Antonatos, M. Poly chronakis, E. P. Mar-
katos and S. Ioannidis, “Gnort: High Performance Net-
work Intrusion Detection Using Graphics Processors,”
Proceedings of the 11th International Symposium on Re-
cent Advances in Intrusion Detection, Cambridge, 15-17
September 2008, pp. 116-134.
[5] D. E. Knuth, J. H. Morris Jr. and V. R. Pratt, “Fast Pattern
Matching in Strings,” SIAM Journal on Computing, Vol.
6, No. 2, 1977, pp. 323-350.
[6] R. S. Boyer and J. S. Moore, “A Fast String Searching
Algorithm,” Communications of the ACM, Vol. 20, No.
10, 1977, pp. 762-772.
[7] A. V. Aho and M. J. Corasick, “Efficient String Matching:
An Aid to Bibliographic Search,” Communications of the
ACM, Vol. 18, No. 6, 1975, pp. 333-340.
[8] S. Wu and U. Manber, “A Fast Algorithm for Multi-Pat-
tern Searching,” Technical Report TR-94-17, University
of Arizona, Tucson, 1994.
[9] B. Commentz-Walter, “A String Matching Algorithm Fast
on the Average,” Automata, Languages and Program-
ming, Vol. 71, 1979, pp. 118-132.
[10] R. M. Karp and M. O. Rabin, “Efficient Randomized
Pattern-Matching Algorithms,” IBM Journal of Research
and Development, Vol. 31, No. 2, 1987, pp. 249-260.
[11] M. Fisk and G. Varghese, “Applying Fast String Match-
ing to Intrusion Detection,” University of California, San
Diego, 2004.
[12] C. J. Coit, S. Staniford and J. McAlerney, “Towards
Faster String Matching for Intrusion Detection or Ex-
ceeding the Speed of Snort,” DARPA Information Sur-
vivability Conference and Exposition, Vol. 1, No. 2, 2001,
pp. 367-373.
[13] M. Roesch, et al., “Snort-Lightweight Intrusion Detection
for Networks,” Proceedings of the 13th USENIX Confer-
ence on System Administration, Seattle, 7-12 November
1999, pp. 229-238.
[14] N. Tuck, T. Sherwood, B. Calder and G. Varghese, “De-
terministic Memory-Efficient String Matching Algorithms
for Intrusion Detection,” INFOCOM, Vol. 4, 2004, pp.
2628-2639.
[15] N. Jacob and C. Brodley, “Offloading IDS Computation
to the GPU,” Proceedings of the 22nd Annual Computer
Security Applications Conference, Washington DC, 11-15
December 2006, pp. 371-380.
[16] L. Marziale, G. G. Richard III and V. Roussev, “Massive
Threading: Using GPUs to Increase the Performance of
Digital Forensics Tools,” Digital Investigation, Vol. 4,
2007, pp. 73-81.
[17] A. T. Nottingham and B. Irwin, “gPF: A GPU Acceler-
ated Packet Classification Tool,” Southern African Tele-
communications Networks and Applications Conference,
Royal Swazi Spa, 30 August-2 September 2009, pp. 339-
344.
[18] R. Smith, N. Goyal, J. Ormont, K. Sankaralingam and C.
Estan, “Evaluating GPUs for Network Packet Signature
Matching,” IEEE International Symposium on Perform-
ance Analysis of Systems and Software, Boston, 26-28
April 2009, pp. 175-184.
doi:10.1109/ISPASS.2009.4919649
[19] F. Yu, Z. Chen, Y. Diao, T. V. Lakshman and R. H. Katz,
“Fast and Memory-Efficient Regular Expression Match-
ing for Deep Packet Inspection,” Proceedings of the 2006
ACM/IEEE Symposium on Architecture for Networking
and Communications Systems, California, 4-5 December
2006, pp. 93-102. doi:10.1145/1185347.1185360
[20] R. Smith, C. Estan, S. Jha and S. Kong, “Deflating the
Big Bang: Fast and Scalable Deep Packet Inspection with
Extended Finite Automata,” SIGCOMM Computer Com-
munication Review, Vol. 38, No. 4, 2008, pp. 207-218.
[21] G. Vasiliadis and S. Ioannidis, “Gravity: A Massively
Parallel Antivirus Engine,” Recent Advances in Intrusion
Detection, Vol. 6307, 2011, pp. 79-96.
[22] E. Seamans and E. Alexander, “Fast Virus Signature
Matching on the GPU,” GPU Gems, Vol. 3, No. 1, 2007,
pp. 771-783.
[23] J. Owens, “GPU Architecture Overview,” ACM SIG-
GRAPH, Vol. 1, No. 2, 2007, pp. 5-9.
[24] R. Smith, C. Estan and S. Jha, “XFA: Faster Signature
Matching with Extended Automata,” Proceedings of the
2008 IEEE Symposium on Security and Privacy, Oakland,
18-21 May 2008, pp. 187-201.
[25] T. Kojm, “ClamAV,” 2004. http://www. clamav. net
[26] M. Pharr and R. Fernando, “2: Programming Techniques
for High-Performance Graphics and General-Purpose
Computation (Gpu Gems),” Addison-Wesley Professional,
Boston, 2005.