-
1.发明申请公开(公告)号：US20100198850A1
公开(公告)日：2010-08-05
申请号：US12703388
申请日：2010-02-10
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , Y10S707/99936
摘要： Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby enhance parallelism and throughput, augmented state transitions that track whether a transition is indicative of a pattern match occurring thereby reducing the number of necessary states for the DFA, augmented state transition that track whether a transition is indicative of a restart to the matching process, compression of the DFA's transition table, alphabet encoding for input symbols to equivalence class identifiers, the use of an indirection table to allow for optimized transition table memory, and enhanced scalability to facilitate the ability of the improved DFA to process multiple input symbols per cycle.
摘要翻译： 这里公开了用于正则表达式模式匹配的改进的架构。 由发明人描述的对模式匹配确定性有限自动机（DFA）的改进包括流水线策略，其将状态相关反馈推送到最终流水线级，从而增强并行度和吞吐量，增强的状态转换，跟踪转移是否指示 模式匹配发生，从而减少了DFA的必要状态数量，增强状态转换，跟踪转移是否指示重新启动到匹配过程，DFA转换表的压缩，输入符号的字母编码等价类标识符， 使用间接表来允许优化的转换表存储器，以及增强的可扩展性，以便于改进的DFA在每个周期处理多个输入符号的能力。
-
2.发明授权公开(公告)号：US07945528B2
公开(公告)日：2011-05-17
申请号：US12703388
申请日：2010-02-10
CPC分类号： G06F17/30985 , Y10S707/99936
摘要： Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby enhance parallelism and throughput, augmented state transitions that track whether a transition is indicative of a pattern match occurring thereby reducing the number of necessary states for the DFA, augmented state transition that track whether a transition is indicative of a restart to the matching process, compression of the DFA's transition table, alphabet encoding for input symbols to equivalence class identifiers, the use of an indirection table to allow for optimized transition table memory, and enhanced scalability to facilitate the ability of the improved DFA to process multiple input symbols per cycle.
摘要翻译： 这里公开了用于正则表达式模式匹配的改进的架构。 由发明人描述的对模式匹配确定性有限自动机（DFA）的改进包括流水线策略，其将状态相关反馈推送到最终流水线级，从而增强并行度和吞吐量，增强的状态转换，跟踪转移是否指示 模式匹配发生，从而减少了DFA的必要状态数量，增强状态转换，跟踪转移是否指示重新启动到匹配过程，DFA转换表的压缩，输入符号的字母编码等价类标识符， 使用间接表来允许优化的转换表存储器，以及增强的可扩展性，以便于改进的DFA在每个周期处理多个输入符号的能力。
-
3.发明授权公开(公告)号：US07702629B2
公开(公告)日：2010-04-20
申请号：US11293619
申请日：2005-12-02
IPC分类号： G06F17/30
CPC分类号： G06F17/30985 , Y10S707/99936
摘要： Disclosed herein is an improved architecture for regular expression pattern matching. Improvements to pattern matching deterministic finite automatons (DFAs) that are described by the inventors include a pipelining strategy that pushes state-dependent feedback to a final pipeline stage to thereby enhance parallelism and throughput, augmented state transitions that track whether a transition is indicative of a pattern match occurring thereby reducing the number of necessary states for the DFA, augmented state transition that track whether a transition is indicative of a restart to the matching process, compression of the DFA's transition table, alphabet encoding for input symbols to equivalence class identifiers, the use of an indirection table to allow for optimized transition table memory, and enhanced scalability to facilitate the ability of the improved DFA to process multiple input symbols per cycle.
摘要翻译： 这里公开了用于正则表达式模式匹配的改进的架构。 由发明人描述的对模式匹配确定性有限自动机（DFA）的改进包括流水线策略，其将状态相关反馈推送到最终流水线级，从而增强并行度和吞吐量，增强的状态转换，跟踪转移是否指示 模式匹配发生，从而减少了DFA的必要状态数量，增强状态转换，跟踪转移是否指示重新启动到匹配过程，DFA转换表的压缩，输入符号的字母编码等价类标识符， 使用间接表来允许优化的转换表存储器，以及增强的可扩展性，以便于改进的DFA在每个周期处理多个输入符号的能力。
-
-
搜索结果
3 条记录 (耗时 0.023 秒)
