公开(公告)号：US20100332798A1

公开(公告)日：2010-12-30

申请号：US12825402

申请日：2010-06-29

申请人： Martin Doerr ,  Hubert Eichner ,  Markus Kaltenbach ,  Volker Koch ,  Ulrich Mayer ,  Thomas Pflueger ,  Thomas Schlipf ,  Cordt Starke ,  Jan Van Lunteren

发明人： Martin Doerr ,  Hubert Eichner ,  Markus Kaltenbach ,  Volker Koch ,  Ulrich Mayer ,  Thomas Pflueger ,  Thomas Schlipf ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F15/76 ,  G06F9/02

CPC分类号： G06F9/3012 ,  G06F9/3828 ,  G06F9/3891

摘要： A processor subunit for a processor for processing data. The processor subunit includes registers, and at least one functional unit for executing instructions on data. One or more registers of the registers are connected to an input of the at least one functional unit, where each register connected to the input of the at least one functional unit which has an input multiplexer. One or more registers of the registers are connected to an output of the at least one functional unit, where each register connected to the output of the at least one functional unit which has an input multiplexer. At least one output bus is connected to at least one register. At least one input bus is connected to at least one register. The processor subunit may be used in a processor, which may be used in a data streaming accelerator.

摘要翻译： 用于处理数据的处理器的处理器子单元。 处理器子单元包括寄存器和用于执行数据指令的至少一个功能单元。 寄存器的一个或多个寄存器被连接到至少一个功能单元的输入，其中每个寄存器连接到具有输入多路复用器的至少一个功能单元的输入。 寄存器的一个或多个寄存器被连接到至少一个功能单元的输出，其中每个寄存器连接到具有输入多路复用器的至少一个功能单元的输出端。 至少一个输出总线连接到至少一个寄存器。 至少一个输入总线连接到至少一个寄存器。 处理器子单元可以用在可以在数据流加速器中使用的处理器中。

公开(公告)号：US07703058B2

公开(公告)日：2010-04-20

申请号：US11740487

申请日：2007-04-26

申请人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

发明人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F17/50

CPC分类号： G06F17/5045

摘要： The invention relates to a method and system for the design and implementation of state machine engines. A first constraints checking step checks a state transition function created by a designer against constraints imposed by the implementation technology in order to detect all portions of the state transition function that are in conflict with the constraints. A subsequent conflict resolution step tries to determine one or more suggested ways to meet the conflicting constraints, by investigating how the original state transition function can be modified such that all constraints are met. A final presentation and selection step provides the designer textual and/or graphically results of the constraints check and suggested modifications. The modifications can be accepted interactively, or the state transition function can be changed manually. In the latter case, the modified state transition function will be processed starting again with the constraints checking step.

摘要翻译： 本发明涉及一种用于设计和实施状态机发动机的方法和系统。 第一约束检查​​步骤检查由设计者创建的状态转换函数，以抵制由实施技术施加的约束，以便检测与约束相冲突的状态转换函数的所有部分。 随后的冲突解决步骤尝试通过调查如何修改原始状态转换功能以满足所有约束来确定满足冲突约束的一种或多种建议方式。 最后的演示和选择步骤为设计者提供了约束检查和建议修改的文本和/或图形结果。 可以交互接受修改，也可以手动更改状态转换功能。 在后一种情况下，将通过约束检查步骤再次开始处理修改的状态转换功能。

公开(公告)号：US20080052488A1

公开(公告)日：2008-02-28

申请号：US11742718

申请日：2007-05-01

申请人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

发明人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F12/00

CPC分类号： G06F12/0864 ,  G06F12/0897

摘要： The present, invention improves the hash table lookup operation by using a new processor cache architecture. A speculative processing of entries stored in the cache is combined with a delayed evaluation of cache entries. The speculative processing means that for each cache entry retrieved from main memory in a step of the hash table lookup operation it is assumed that it already contains the selected hash table entry. The delayed evaluation means that certain steps of the lookup operation are performed in parallel with others. In advantageous embodiments the invention can also be used in conjunction with a hierarchy of inclusive caches. The preferred embodiments of the invention involve a new approach for a transition rule cache of a BaRT-FSM controller.

摘要翻译： 本发明通过使用新的处理器高速缓存架构来改进哈希表查找操作。 存储在缓存中的条目的推测性处理与缓存条目的延迟评估相结合。 推测处理意味着对于在哈希表查找操作的步骤中从主存储器检索的每个高速缓存条目，假设它已经包含所选择的哈希表条目。 延迟评估意味着查找操作的某些步骤与其他操作并行执行。 在有利的实施例中，本发明还可以与包含缓存的层次结构一起使用。 本发明的优选实施例涉及用于BaRT-FSM控制器的转换规则高速缓存的新方法。

公开(公告)号：US20070282573A1

公开(公告)日：2007-12-06

申请号：US11740558

申请日：2007-04-26

申请人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

发明人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F17/18

CPC分类号： G06F17/2247

摘要： The invention relates to a method of optimizing a state transition function specification for a state machine engine based on a probability distribution for the state transitions. For the preferred embodiment of the invention, a B-FSM state machine engine accesses a transition rule memory using a processor cache. The invention allows improving the cache hit rate by exploiting the probability distribution. The N transition rules that comprise a hash table entry will be loaded in a burst mode from the main memory, from which the N transition rules are transferred to the processor cache. Because the comparison of the actual state and input values against each of the transition rules can immediately start after each of these rules has been received, the overall performance is improved as the transition rule that is most likely to be selected is the first to be transferred as part of the burst access.

摘要翻译： 本发明涉及一种基于状态转换的概率分布优化状态机引擎的状态转换功能规范的方法。 对于本发明的优选实施例，B-FSM状态机引擎使用处理器高速缓存来访问转换规则存储器。 本发明允许通过利用概率分布来提高缓存命中率。 构成哈希表条目的N个转换规则将以从主存储器的突发模式加载，N个转换规则从该存储器传送到处理器高速缓存。 因为实际状态和输入值与每个转换规则的比较可以在接收到每个这些规则之后立即开始，因为最有可能被选择的转换规则是首先被转移的整体性能得到改善 作为突发访问的一部分。

公开(公告)号：US07844422B2

公开(公告)日：2010-11-30

申请号：US11740558

申请日：2007-04-26

申请人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

发明人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F17/10

CPC分类号： G06F17/2247

摘要： The invention relates to a method of optimizing a state transition function specification for a state machine engine based on a probability distribution for the state transitions. For the preferred embodiment of the invention, a B-FSM state machine engine accesses a transition rule memory using a processor cache. The invention allows improving the cache hit rate by exploiting the probability distribution. The N transition rules that comprise a hash table entry will be loaded in a burst mode from the main memory, from which the N transition rules are transferred to the processor cache. Because the comparison of the actual state and input values against each of the transition rules can immediately start after each of these rules has been received, the overall performance is improved as the transition rule that is most likely to be selected is the first to be transferred as part of the burst access.

摘要翻译： 本发明涉及一种基于状态转换的概率分布优化状态机引擎的状态转换功能规范的方法。 对于本发明的优选实施例，B-FSM状态机引擎使用处理器高速缓存来访问转换规则存储器。 本发明允许通过利用概率分布来提高缓存命中率。 构成哈希表条目的N个转换规则将以从主存储器的突发模式加载，N个转换规则从该存储器传送到处理器高速缓存。 因为实际状态和输入值与每个转换规则的比较可以在接收到每个这些规则之后立即开始，因为最有可能选择的转换规则是首先被转移的整体性能得到改善 作为突发访问的一部分。

公开(公告)号：US20070283300A1

公开(公告)日：2007-12-06

申请号：US11740487

申请日：2007-04-26

申请人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

发明人： Rolf Fritz ,  Markus Kaltenbach ,  Ulrich Mayer ,  Thomas Pflueger ,  Cordt Starke ,  Jan Van Lunteren

IPC分类号： G06F17/50

CPC分类号： G06F17/5045

摘要： The invention relates to a method and system for the design and implementation of state machine engines. A first constraints checking step checks a state transition function created by a designer against constraints imposed by the implementation technology in order to detect all portions of the state transition function that are in conflict with the constraints. A subsequent conflict resolution step tries to determine one or more suggested ways to meet the conflicting constraints, by investigating how the original state transition function can be modified such that all constraints are met. A final presentation and selection step provides the designer textual and/or graphically results of the constraints check and suggested modifications. The modifications can be accepted interactively, or the state transition function can be changed manually. In the latter case, the modified state transition function will be processed starting again with the constraints checking step.

摘要翻译： 本发明涉及一种用于设计和实施状态机发动机的方法和系统。 第一约束检查​​步骤检查由设计者创建的状态转换函数，以抵制由实施技术施加的约束，以便检测与约束相冲突的状态转换函数的所有部分。 随后的冲突解决步骤尝试通过调查如何修改原始状态转换功能以满足所有约束来确定满足冲突约束的一种或多种建议方式。 最后的演示和选择步骤为设计者提供了约束检查和建议修改的文本和/或图形结果。 可以交互接受修改，也可以手动更改状态转换功能。 在后一种情况下，将通过约束检查步骤再次开始处理修改的状态转换功能。

公开(公告)号：US07683665B1

公开(公告)日：2010-03-23

申请号：US12427559

申请日：2009-04-21

申请人： Rolf Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Christopher S Smith

发明人： Rolf Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Christopher S Smith

IPC分类号： H03K19/173

CPC分类号： G05B19/042 ,  G05B2219/23289

摘要： A system and method of implementing multiple programmable finite state machines using a shared transition table is disclosed, the method including forming a plurality of finite state machine cores such that an amount of the plurality of finite state machine cores is unchangeable, forming a state transition array, and forming a routing network such that the forming the plurality of associated state transition elements is realized.

摘要翻译： 公开了一种使用共享转换表实现多个可编程有限状态机的系统和方法，该方法包括形成多个有限状态机核，使得多个有限状态机核的数量不可改变，形成状态转移阵列 并且形成路由网络，从而实现形成多个相关联的状态转换元件。

公开(公告)号：US08392636B2

公开(公告)日：2013-03-05

申请号：US12546852

申请日：2009-08-25

申请人： Rolf K. Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Stephan Christopher Smith

发明人： Rolf K. Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Stephan Christopher Smith

IPC分类号： G06F3/00 ,  G06F5/00 ,  G06F7/38 ,  H03K19/173

CPC分类号： H04L49/90

摘要： A method and apparatus for processing data by a pipeline of a virtual multiple instance extended finite state machine (VMI EFSM). An input token is selected to enter the pipeline. The input token includes a reference to an EFSM instance, an extended command, and an operation code. The EFSM instance requires the resource to be available to generate an output token from the input token. In response to receiving an indication that the resource is unavailable, the input token is sent to a wait room or an initiative token containing the reference and the operation code is sent to a wait queue, and the output token is not generated. Without stalling and restarting the pipeline, another input token is processed in the pipeline while the resource is unavailable and while the input token is in the wait room or the initiative token is in the wait queue.

摘要翻译： 一种用于通过虚拟多实例扩展有限状态机（VMI EFSM）的流水线处理数据的方法和装置。 选择输入令牌进入管道。 输入令牌包括对EFSM实例的引用，扩展命令和操作代码。 EFSM实例需要资源可用于从输入令牌生成输出令牌。 响应于接收到资源不可用的指示，将输入令牌发送到等待室或包含引用的主动令牌，并且将操作代码发送到等待队列，并且不生成输出令牌。 在不停止并重新启动流水线的情况下，另一个输入令牌在流水线中处理，而资源不可用，而输入令牌位于等待室或主动令牌处于等待队列中。

公开(公告)号：US20110055842A1

公开(公告)日：2011-03-03

申请号：US12546852

申请日：2009-08-25

申请人： Rolf K. Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Stephan Christopher Smith

发明人： Rolf K. Fritz ,  Ulrich Mayer ,  Thomas Schlipf ,  Stephan Christopher Smith

IPC分类号： G06F9/46

CPC分类号： H04L49/90

摘要： A method and apparatus for processing data by a pipeline of a virtual multiple instance extended finite state machine (VMI EFSM). An input token is selected to enter the pipeline. The input token includes a reference to an EFSM instance, an extended command, and an operation code. The EFSM instance requires the resource to be available to generate an output token from the input token. In response to receiving an indication that the resource is unavailable, the input token is sent to a wait room or an initiative token containing the reference and the operation code is sent to a wait queue, and the output token is not generated. Without stalling and restarting the pipeline, another input token is processed in the pipeline while the resource is unavailable and while the input token is in the wait room or the initiative token is in the wait queue.

摘要翻译： 一种用于通过虚拟多实例扩展有限状态机（VMI EFSM）的流水线处理数据的方法和装置。 选择输入令牌进入管道。 输入令牌包括对EFSM实例的引用，扩展命令和操作代码。 EFSM实例需要资源可用于从输入令牌生成输出令牌。 响应于接收到资源不可用的指示，将输入令牌发送到等待室或包含引用的主动令牌，并且将操作代码发送到等待队列，并且不生成输出令牌。 在不停止并重新启动流水线的情况下，另一个输入令牌在流水线中处理，而资源不可用，而输入令牌位于等待室或主动令牌处于等待队列中。

公开(公告)号：US09891922B2

公开(公告)日：2018-02-13

申请号：US13524402

申请日：2012-06-15

申请人： James J. Bonanno ,  Ulrich Mayer ,  Anthony Saporito ,  Chung-Lung K. Shum ,  Timothy J. Slegel

发明人： James J. Bonanno ,  Ulrich Mayer ,  Anthony Saporito ,  Chung-Lung K. Shum ,  Timothy J. Slegel

IPC分类号： G06F9/38 ,  G06F9/30

CPC分类号： G06F9/38 ,  G06F9/30076 ,  G06F9/3844 ,  G06F9/3848

摘要： Embodiments relate to selectively blocking branch instruction predictions. An aspect includes a computer system for performing selective branch prediction. The system includes memory and a processor, and the system is configured to perform a method. The method includes detecting a branch-prediction blocking instruction in a stream of instructions and blocking branch prediction of a predetermined number of branch instructions following the branch-prediction blocking instruction based on the detecting the branch-prediction blocking instruction.