正则表达式与BSP自动机的并行匹配

2019 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2019-07-01 DOI:10.1109/HPCS48598.2019.9188181

Thibaut Tachon

{"title":"正则表达式与BSP自动机的并行匹配","authors":"Thibaut Tachon","doi":"10.1109/HPCS48598.2019.9188181","DOIUrl":null,"url":null,"abstract":"Regular expression matching is a core component of many applications including patterns search in text, deep inspection of packet or lexical analysis. Sequential regular expression matching lacks efficiency for large amount of data whereas parallel regular expression matching overhead requires a large number of processors to become negligible. This paper presents a transformation from regular expression (RE) into a parallel form named BSP regular expression (BSPRE). This transformation added to the transformation from BSPRE to parallel automata (BSPA) enable the parallel matching of regular expression. We compare this approach to enumeration method and observe substantial improvement for small number of processors. The automatic transformation from RE to BSPA through BSPRE is the first example of an infinite family of BSP programs that can be generated automatically and that are not simple specializations of a finite library.","PeriodicalId":371856,"journal":{"name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel Matching of Regular Expressions with BSP Automata\",\"authors\":\"Thibaut Tachon\",\"doi\":\"10.1109/HPCS48598.2019.9188181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Regular expression matching is a core component of many applications including patterns search in text, deep inspection of packet or lexical analysis. Sequential regular expression matching lacks efficiency for large amount of data whereas parallel regular expression matching overhead requires a large number of processors to become negligible. This paper presents a transformation from regular expression (RE) into a parallel form named BSP regular expression (BSPRE). This transformation added to the transformation from BSPRE to parallel automata (BSPA) enable the parallel matching of regular expression. We compare this approach to enumeration method and observe substantial improvement for small number of processors. The automatic transformation from RE to BSPA through BSPRE is the first example of an infinite family of BSP programs that can be generated automatically and that are not simple specializations of a finite library.\",\"PeriodicalId\":371856,\"journal\":{\"name\":\"2019 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCS48598.2019.9188181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS48598.2019.9188181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

正则表达式匹配是许多应用程序的核心组件，包括文本中的模式搜索、包的深度检查或词法分析。顺序正则表达式匹配对于大量数据缺乏效率，而并行正则表达式匹配开销需要大量处理器才能忽略不计。本文提出了正则表达式(RE)到并行形式BSP正则表达式(BSPRE)的转换方法。该转换添加到BSPRE到并行自动机(BSPA)的转换中，实现了正则表达式的并行匹配。我们将这种方法与枚举方法进行比较，发现对于少量处理器有很大的改进。通过BSPRE从RE到BSPA的自动转换是可以自动生成的无限族BSP程序的第一个例子，这些程序不是有限库的简单专门化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Parallel Matching of Regular Expressions with BSP Automata

Regular expression matching is a core component of many applications including patterns search in text, deep inspection of packet or lexical analysis. Sequential regular expression matching lacks efficiency for large amount of data whereas parallel regular expression matching overhead requires a large number of processors to become negligible. This paper presents a transformation from regular expression (RE) into a parallel form named BSP regular expression (BSPRE). This transformation added to the transformation from BSPRE to parallel automata (BSPA) enable the parallel matching of regular expression. We compare this approach to enumeration method and observe substantial improvement for small number of processors. The automatic transformation from RE to BSPA through BSPRE is the first example of an infinite family of BSP programs that can be generated automatically and that are not simple specializations of a finite library.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 International Conference on High Performance Computing & Simulation (HPCS)

自引率

0.00%

发文量