{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:01:32Z","timestamp":1769270492938,"version":"3.49.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2010,10,22]],"date-time":"2010-10-22T00:00:00Z","timestamp":1287705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2010,10,22]]},"abstract":"<jats:p>This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing the compilation of very large and complex rule sets that are otherwise hard to treat. iNFAnt is explicitly designed and developed to run on graphical processing units that provide large amounts of concurrent threads; this parallelism is exploited to handle the non-determinism of the model and to process multiple packets at once, thus achieving high performance levels.<\/jats:p>","DOI":"10.1145\/1880153.1880157","type":"journal-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T13:52:03Z","timestamp":1289310723000},"page":"20-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":80,"title":["iNFAnt"],"prefix":"10.1145","volume":"40","author":[{"given":"Niccolo'","family":"Cascarano","sequence":"first","affiliation":[{"name":"Politecnico di Torino, Turin, Italy"}]},{"given":"Pierluigi","family":"Rolando","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Turin, Italy"}]},{"given":"Fulvio","family":"Risso","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Turin, Italy"}]},{"given":"Riccardo","family":"Sisto","sequence":"additional","affiliation":[{"name":"Politecnico di Torino, Turin, Italy"}]}],"member":"320","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364656"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477950"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882486.1882495"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1626195.1626228"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2009.4919649"},{"issue":"3","key":"e_1_2_1_6_1","first-page":"2010","article-title":"and. Molnar. Traffic classification over gbit speed with commodity hardware. In accepted for publication","volume":"5","author":"Szabo G.","year":"2010","unstructured":"G. Szabo , I. Godor , A. Veres , and S. Malomsoky , Sz . and. Molnar. Traffic classification over gbit speed with commodity hardware. In accepted for publication in IEEE Journal of Communications Software and Systems , 2010 , Vol. 5 , Num. 3 ., 2010 . G. Szabo, I. Godor, A. Veres, and S. Malomsoky, Sz. and. Molnar. Traffic classification over gbit speed with commodity hardware. In accepted for publication in IEEE Journal of Communications Software and Systems, 2010, Vol. 5, Num. 3., 2010.","journal-title":"IEEE Journal of Communications Software and Systems"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87403-4_7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04342-0_14"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880153.1880157","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1880153.1880157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:16Z","timestamp":1750243936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880153.1880157"}},"subtitle":["NFA pattern matching on GPGPU devices"],"short-title":[],"issued":{"date-parts":[[2010,10,22]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10,22]]}},"alternative-id":["10.1145\/1880153.1880157"],"URL":"https:\/\/doi.org\/10.1145\/1880153.1880157","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2010,10,22]]},"assertion":[{"value":"2010-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}