-
1.发明申请Determination and Handling of Subexpression Overlaps in Regular Expression Decompositions 审中-公开正则表达式分解中子表达式重叠的确定和处理公开(公告)号：US20130262492A1
公开(公告)日：2013-10-03
申请号：US13432252
申请日：2012-03-28
IPC分类号： G06F17/30
CPC分类号： G06F16/90344
摘要： A computer-implemented method for transforming a finite state automaton (FSA) of a regular expression includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.
摘要翻译： 用于转换正则表达式的有限状态自动机（FSA）的计算机实现的方法包括由计算机确定正则表达式中的第一子表达式R1和第二子表达式R2; 计算重叠FSA，配置为确定第一子表达式R1和第二子表达式R2之间的部分重叠或全部重叠的存在的重叠FSA; 确定重叠FSA是否具有接受状态; 并且在重叠FSA被确定为不具有接受状态的情况下，确定正则表达式的变换是安全的，并且构建包括用于第一子表达式R1的第一FSA和第二FSA的正则表达式的变换FSA， 第二个子表达式R2。
-
2.发明授权Determination and handling of subexpression overlaps in regular expression decompostions 失效正则表达式分解中子表达式重叠的确定和处理公开(公告)号：US08620968B2
公开(公告)日：2013-12-31
申请号：US13571431
申请日：2012-08-10
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： A computer program product comprising a computer readable storage medium containing computer code that, when executed by a computer, implements a method for transforming a finite state automaton (FSA) of a regular expression, wherein the method includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.
摘要翻译： 一种计算机程序产品，包括包含计算机代码的计算机可读存储介质，所述计算机代码当由计算机执行时实现用于转换正则表达式的有限状态自动机（FSA）的方法，其中所述方法包括由计算机确定第一 正则表达式中的子表达式R1和第二子表达式R2; 计算重叠FSA，配置为确定第一子表达式R1和第二子表达式R2之间的部分重叠或全部重叠的存在的重叠FSA; 确定重叠FSA是否具有接受状态; 并且在重叠FSA被确定为不具有接受状态的情况下，确定正则表达式的变换是安全的，并且构建包括用于第一子表达式R1的第一FSA和第二FSA的正则表达式的变换FSA， 第二个子表达式R2。
-
3.发明申请Determination and Handling of Subexpression Overlaps in Regular Expression Decompositions 失效正则表达式分解中子表达式重叠的确定和处理公开(公告)号：US20130262493A1
公开(公告)日：2013-10-03
申请号：US13571431
申请日：2012-08-10
IPC分类号： G06F17/30
CPC分类号： G06F17/30985
摘要： A computer program product comprising a computer readable storage medium containing computer code that, when executed by a computer, implements a method for transforming a finite state automaton (FSA) of a regular expression, wherein the method includes determining, by a computer, a first subexpression R1 and a second subexpression R2 in the regular expression; calculating an overlap FSA, the overlap FSA configured to determine the existence of a partial overlap or a full overlap between the first subexpression R1 and the second subexpression R2; determining whether the overlap FSA has an accepting state; and in the event the overlap FSA is determined not to have an accepting state, determining that the transformation of the regular expression is safe, and constructing a transformed FSA of the regular expression comprising a first FSA for the first subexpression R1 and a second FSA for the second subexpression R2.
摘要翻译： 一种计算机程序产品，包括包含计算机代码的计算机可读存储介质，所述计算机代码当由计算机执行时实现用于转换正则表达式的有限状态自动机（FSA）的方法，其中所述方法包括由计算机确定第一 正则表达式中的子表达式R1和第二子表达式R2; 计算重叠FSA，配置为确定第一子表达式R1和第二子表达式R2之间的部分重叠或全部重叠的存在的重叠FSA; 确定重叠FSA是否具有接受状态; 并且在重叠FSA被确定为不具有接受状态的情况下，确定正则表达式的变换是安全的，并且构建包括用于第一子表达式R1的第一FSA和第二FSA的正则表达式的变换FSA， 第二个子表达式R2。
-
4.发明申请COMPILING PATTERN CONTEXTS TO SCAN LANES UNDER INSTRUCTION EXECUTION CONSTRAINTS 有权根据指令执行规则编写模式到扫描范围公开(公告)号：US20120284222A1
公开(公告)日：2012-11-08
申请号：US13098772
申请日：2011-05-02
IPC分类号： G06N5/02
CPC分类号： H04L63/1408
摘要： A technique for determining scan lanes is provided. For a set of patterns, a number of scan lanes is estimated to be utilized on an accelerator. The number of the scan lanes estimated for the set of patterns is iteratively incremented to optimize a throughput of the accelerator. The set of patterns is distributed to the number of the scan lanes as a distribution, and each one of the scan lanes has a predetermined number of engines. A size of a memory space is evaluated that is needed for the distribution to distribute the set of patterns onto the number of scan lanes.
摘要翻译： 提供了一种用于确定扫描通道的技术。 对于一组模式，估计在加速器上使用多个扫描通道。 针对该组模式估计的扫描通道的数量被迭代地增加以优化加速器的吞吐量。 该组图案被分配到扫描通道的数量作为分布，并且每个扫描通道具有预定数量的引擎。 评估存储器空间的大小，以便将该组图案分配到扫描通道数上。
-
5.发明授权Method and device for distributing patterns to scanning engines for scanning patterns in a packet stream 失效用于向扫描引擎分发模式以扫描分组流中的模式的方法和设备公开(公告)号：US08386411B2
公开(公告)日：2013-02-26
申请号：US12793725
申请日：2010-06-04
CPC分类号： G06N5/02 , H04L63/0227 , H04L63/1441 , H04L69/22
摘要： A method and a device for distributing patterns to scanning engines for scanning packets in a packet stream are provided. The method includes providing a plurality of scanning engines and patterns, calculating a respective distance metric for every pair of patterns, and providing a plurality of distribution functions. Further, the method includes calculating a respective sum of the calculated distance metrics for distributing the patterns for each of the distribution functions, and utilizing the sums for selecting a distribution function of the D distribution functions for distributing the patterns to the M scanning engines. A device for implementing the method is also provided.
摘要翻译： 提供了一种用于向扫描引擎分发模式以扫描分组流中的分组的方法和设备。 该方法包括提供多个扫描引擎和模式，为每对模式计算相应的距离度量，并提供多个分布函数。 此外，该方法包括计算用于分配每个分布函数的模式的所计算的距离度量的相应和，并且使用用于选择用于将模式分发给M个扫描引擎的D分布函数的分布函数的和。 还提供了一种用于实现该方法的设备。
-
6.发明授权Compiling pattern contexts to scan lanes under instruction execution constraints 有权编译模式上下文以在指令执行约束下扫描通道公开(公告)号：US09246928B2
公开(公告)日：2016-01-26
申请号：US13098772
申请日：2011-05-02
CPC分类号： H04L63/1408
摘要： A technique for determining scan lanes is provided. For a set of patterns, a number of scan lanes is estimated to be utilized on an accelerator. The number of the scan lanes estimated for the set of patterns is iteratively incremented to optimize a throughput of the accelerator. The set of patterns is distributed to the number of the scan lanes as a distribution, and each one of the scan lanes has a predetermined number of engines. A size of a memory space is evaluated that is needed for the distribution to distribute the set of patterns onto the number of scan lanes.
摘要翻译： 提供了一种用于确定扫描通道的技术。 对于一组模式，估计在加速器上使用多个扫描通道。 针对该组模式估计的扫描通道的数量被迭代地增加以优化加速器的吞吐量。 该组图案被分配到扫描通道的数量作为分布，并且每个扫描通道具有预定数量的引擎。 评估存储器空间的大小，以便将该组图案分配到扫描通道数上。
-
7.发明申请METHOD AND DEVICE FOR DISTRIBUTING PATTERNS TO SCANNING ENGINES FOR SCANNING PATTERNS IN A PACKET STREAM 失效用于分布图案的扫描模式的方法和装置，用于分组流中的扫描模式公开(公告)号：US20100312742A1
公开(公告)日：2010-12-09
申请号：US12793725
申请日：2010-06-04
IPC分类号： G06F17/00 , G06F15/173
CPC分类号： G06N5/02 , H04L63/0227 , H04L63/1441 , H04L69/22
摘要： A method and a device for distributing patterns to scanning engines for scanning packets in a packet stream are provided. The method includes providing a plurality of scanning engines and patterns, calculating a respective distance metric for every pair of patterns, and providing a plurality of distribution functions. Further, the method includes calculating a respective sum of the calculated distance metrics for distributing the patterns for each of the distribution functions, and utilizing the sums for selecting a distribution function of the D distribution functions for distributing the patterns to the M scanning engines. A device for implementing the method is also provided.
摘要翻译： 提供了一种用于向扫描引擎分发模式以扫描分组流中的分组的方法和设备。 该方法包括提供多个扫描引擎和模式，为每对模式计算相应的距离度量，并提供多个分布函数。 此外，该方法包括计算用于分配每个分布函数的模式的所计算的距离度量的相应和，并且使用用于选择用于将模式分发给M个扫描引擎的D分布函数的分布函数的和。 还提供了一种用于实现该方法的设备。
-
8.发明申请VERIFYING CORRECTNESS OF REGULAR EXPRESSION TRANSFORMATIONS THAT USE A POST-PROCESSOR 失效验证使用后处理器的常规表达式转换的正确性公开(公告)号：US20130007530A1
公开(公告)日：2013-01-03
申请号：US13170739
申请日：2011-06-28
IPC分类号： G06F11/28
CPC分类号： G06F11/3608
摘要： A method for determining correctness of a transformation between a first finite state automaton (FSA) and a second FSA, wherein the first FSA comprises a representation of a regular expression, and the second FSA comprises a transformation of the first FSA includes determining a third FSA, the third FSA comprising a cross product of the second FSA and a post-processor; determining whether the first FSA and the third FSA are equivalent; and in the event that the first FSA is determined not to be equivalent to the third FSA, determining that the transformation between the first FSA and the second FSA is not correct.
摘要翻译： 一种用于确定第一有限状态自动机（FSA）和第二FSA之间的变换的正确性的方法，其中所述第一FSA包括正则表达式的表示，并且所述第二FSA包括所述第一FSA的变换包括确定第三FSA 所述第三FSA包括所述第二FSA和后处理器的交叉乘积; 确定第一个FSA和第三个FSA是否相当; 并且在第一FSA被确定为不等于第三FSA的情况下，确定第一FSA与第二FSA之间的转换是不正确的。
-
9.发明授权Verifying correctness of regular expression transformations that use a post-processor 失效验证使用后处理器的正则表达式转换的正确性公开(公告)号：US08688608B2
公开(公告)日：2014-04-01
申请号：US13170739
申请日：2011-06-28
IPC分类号： G06F11/28
CPC分类号： G06F11/3608
摘要： A method for determining correctness of a transformation between a first finite state automaton (FSA) and a second FSA, wherein the first FSA comprises a representation of a regular expression, and the second FSA comprises a transformation of the first FSA includes determining a third FSA, the third FSA comprising a cross product of the second FSA and a post-processor; determining whether the first FSA and the third FSA are equivalent; and in the event that the first FSA is determined not to be equivalent to the third FSA, determining that the transformation between the first FSA and the second FSA is not correct.
摘要翻译： 一种用于确定第一有限状态自动机（FSA）和第二FSA之间的变换的正确性的方法，其中所述第一FSA包括正则表达式的表示，并且所述第二FSA包括所述第一FSA的变换包括确定第三FSA 所述第三FSA包括所述第二FSA和后处理器的交叉乘积; 确定第一个FSA和第三个FSA是否相当; 并且在第一FSA被确定为不等于第三FSA的情况下，确定第一FSA与第二FSA之间的转换是不正确的。
-
公开(公告)号：US07685587B2
公开(公告)日：2010-03-23
申请号：US10716907
申请日：2003-11-19
申请人： Laura Pozzi , Kubilay Atasu , Paolo Ienne Lopez
发明人： Laura Pozzi , Kubilay Atasu , Paolo Ienne Lopez
IPC分类号： G06F9/44
CPC分类号： G06F8/433
摘要： Commercial data processors are available that include a capability of extending their instruction set for a specified application, i.e. of introducing customized functional units in the interest of enhanced processing performance. For such processors there is a need for automatically forming the extensions from high-level application code. A technique is described for selecting maximal-speedup convex subgraphs of the application dataflow graph under micro-architectural constraints.
摘要翻译： 商业数据处理器是可用的，其包括扩展其指定应用的指令集的能力，即为了增强的处理性能引入定制的功能单元。 对于这样的处理器，需要从高级应用代码自动形成扩展。 描述了一种用于在微架构约束下选择应用数据流图的最大加速凸子图的技术。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.027 秒)
