会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Pipelined cache system having low effective latency for nonsequential
accesses
    • 流水线缓存系统对于非顺序访问具有低有效等待时间
    • US5561782A
    • 1996-10-01
    • US269650
    • 1994-06-30
    • Dennis O'Connor
    • Dennis O'Connor
    • G06F9/38G06F12/08G06F9/32G06F13/00
    • G06F12/0855G06F9/3808
    • A method and apparatus for reducing the effective latency for nonsequential memory accesses is disclosed. An improved cache includes a multi-stage pipelined cache that provides at least one cache output record in response to a record address hitting the pipelined cache. The pipelined cache provides the record after an idle period of L clock cycles in which the pipelined cache provides no output records. The effective latency of the pipelined cache is reduced by providing a branch target cache (BTC) that issues at least one record during the idle period in response to a nonsequential record address hitting the BTC. The records stored in the caches may, for example, represent instructions. The cache further includes a lookahead circuit for providing the nonsequential record address (A) and a lookahead address (A+(L.times.W), where W denotes the issue width) to the pipelined cache during a zero cycle preceding the idle period. The pipelined cache respectively provides a nonsequential record and a lookahead record from the lookahead address after the idle period in response to the nonsequential record address and the lookahead address hitting the pipelined cache. A multiplexer selects the nonsequential record from the pipelined cache as an output if the nonsequential address misses the BTC. The multiplexer selects the lookahead record as the output if the nonsequential address hits the BTC. Various modifications of this technique are also described.
    • 公开了一种减少非顺序存储器访问的有效等待时间的方法和装置。 改进的高速缓存包括多级流水线缓存,其响应于触发流水线缓存的记录地址而提供至少一个高速缓存输出记录。 流水线缓存在L个时钟周期的空闲周期之后提供记录,其中流水线缓存不提供输出记录。 流水线缓存的有效延迟通过提供在空闲周期期间响应于不依赖的记录地址击中BTC而发出至少一个记录的分支目标高速缓存(BTC)来减少。 存储在高速缓存中的记录可以例如表示指令。 高速缓存还包括用于在空闲周期之前的零周期期间向流水线高速缓存提供非顺序记录地址(A)和前瞻性地址(A +(LxW),其中W表示发布宽度)的查找电路。 流水线缓存分别响应于非顺序记录地址和查找流水线缓存的前瞻性地址,在空闲周期之后分别提供来自前瞻地址的非顺序记录和查找记录。 如果非顺序地址错过了BTC,则多路复用器从流水线缓存中选择非顺序记录作为输出。 如果非顺序地址匹配BTC,则多路复用器选择前瞻记录作为输出。 还描述了该技术的各种修改。
    • 10. 发明授权
    • Programmable state machine employing a cache-like arrangement
    • 采用缓存式布置的可编程状态机
    • US5905902A
    • 1999-05-18
    • US537155
    • 1995-09-28
    • Dennis O'Connor
    • Dennis O'Connor
    • G05B19/042G06F12/08G06F13/00
    • G06F12/0875G05B19/0426G05B2219/23289
    • The programmable state machine includes a tag entry array and a new state array. All permissible combinations of current states and input values are represented within the tag entry array. The corresponding new state, to be transitioned to for each combination of current states and input values, is stored in the new state array. The tag entry array receives the current state and the input signals and generates a hit signal identifying which of the tag entries corresponds to the current state and input value signals. The new state array outputs the corresponding new state, based upon the hit signal received. In one embodiment, the tag entry array is configured as a fully associative cache tag entry array. In another embodiment, the tag entry array is configured as a set associative cache array. To eliminate the need to redundantly store a single new state, that corresponds to a large number of different transitions, a compare under mask arrangement is provided. As an alternative, a default new state arrangement is provided which outputs a default new state if a miss is detected within the tag entry array.
    • 可编程状态机包括标签输入阵列和新的状态阵列。 当前状态和输入值的所有允许的组合在标签条目数组中表示。 要转换到当前状态和输入值的每个组合的相应的新状态存储在新的状态数组中。 标签条目阵列接收当前状态和输入信号,并产生一个命中信号,该命中信号标识哪个标签条目对应于当前状态和输入值信号。 新状态阵列根据接收的命中信号输出相应的新状态。 在一个实施例中,标签条目阵列被配置为完全关联的高速缓存标签条目阵列。 在另一个实施例中,标签条目阵列被配置为集合关联高速缓存阵列。 为了消除冗余存储单个新状态的需要,其对应于大量不同的转换,提供了掩码布置下的比较。 作为替代,提供了默认的新状态布置,如果在标签条目阵列内检测到未命中则输出默认的新状态。