会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Data processing system having a synchronizing link stack and method
thereof
    • 具有同步链路栈的数据处理系统及其方法
    • US6157999A
    • 2000-12-05
    • US868467
    • 1997-06-03
    • Paul C. RossbachAlbert R. KennedyJeffrey P. Rupley, IIBradley G. Burgess
    • Paul C. RossbachAlbert R. KennedyJeffrey P. Rupley, IIBradley G. Burgess
    • G06F9/38G06F9/42
    • G06F9/3806G06F9/30054G06F9/3844G06F9/4426
    • When a request to branch to an address stored in a return memory location (440) occurs, a busy bit is used to determine whether the return memory location (440) contains updated information. When the information is not updated, a predicted address is provided to the prediction verifier (460) by the link stack (410). Once the busy bit is valid, the prediction verifier (460) determines if a proper prediction was made. When an improper prediction was made, the update portion (415) of the link stack (410) based on information from the comparator (425) determines if a value stored in the link stack (410) matches the value stored in the return memory location (440). The link stack (410) is synchronized based upon a favorable comparison indicating the return memory location value matches a value in the link stack. If a match is not found, the predicted address is placed back on the link stack or alternatively the link stack is cleared.
    • 当发生分支到存储在返回存储器位置(440)中的地址的请求时,使用忙位来确定返回存储器位置(440)是否包含更新的信息。 当不更新信息时,通过链路栈(410)将预测地址提供给预测验证器(460)。 一旦忙位有效,预测验证器(460)确定是否进行了适当的预测。 当进行不正确的预测时,基于来自比较器(425)的信息,链接堆栈(410)的更新部分(415)确定存储在链接堆栈(410)中的值是否与存储在返回存储器位置中的值相匹配 (440)。 基于指示返回存储器位置值与链路栈中的值匹配的有利比较,链路栈(410)被同步。 如果没有找到匹配项,则将预测的地址放回到链路栈,或者链路栈被清除。
    • 9. 发明授权
    • Intelligent electrically erasable, programmable read-only memory with
improved read latency
    • 智能电可擦除可编程只读存储器,具有改进的读延迟
    • US5034922A
    • 1991-07-23
    • US135945
    • 1987-12-21
    • Bradley G. Burgess
    • Bradley G. Burgess
    • G11C16/26G11C16/32
    • G11C16/26G11C16/32
    • An intelligent electrically erasable, programmable read-only memory achieves improved worst-case read operation latency by allowing for the interruption of write operations by subsequently received read requests. In the preferred embodiment, a state machine controller executes write operations by an iterative process of write pulses and write verify cycles. In addition, cells are erased prior to being written to by a similar iterative process. Both the write operations and the erase operations may be interrupted by read requests received after the write operation has begun execution. To avoid reading incorrect data in the case of a read operation at the same address as an interrupted write operation, a comparator matches read operation addresses with latched write operation addresses and provides the read operation data from a write data latch in the case of a match.
    • 智能电可擦除可编程只读存储器通过允许随后接收到的读请求中断写操作来实现改进的最坏情况读操作等待时间。 在优选实施例中,状态机控制器通过写入脉冲和写入验证周期的迭代处理执行写入操作。 此外,在通过类似的迭代过程被写入之前,单元被擦除。 写入操作和擦除操作都可能在写操作开始执行之后被读取请求中断。 为了避免在与中断的写入操作相同的地址处读取操作的情况下读取不正确的数据,比较器将读操作地址与锁存的写操作地址相匹配,并且在匹配的情况下从写数据锁存器提供读操作数据 。
    • 10. 发明授权
    • Data processor with rename buffer and FIFO buffer for in-order
instruction completion
    • 具有重命名缓冲器和FIFO缓冲器的数据处理器,用于按顺序指令完成
    • US5500943A
    • 1996-03-19
    • US442913
    • 1995-05-17
    • Ying-wai HoBradley G. Burgess
    • Ying-wai HoBradley G. Burgess
    • G06F9/32G06F9/38G06F9/30
    • G06F9/30094G06F9/3863
    • A data processor has first calculation circuitry (26), a rename buffer (34), and a queue (36). The first calculation circuitry generates a first and a second result from supplied operands and received programmed instructions. The rename buffer is coupled to the first calculation circuitry and stores a series of first results received from the first calculation circuitry. The rename buffer outputs the series of first results to a first predetermined register. The queue is also coupled to the first calculation circuitry and stores a series of second results. The queue outputs the sequence of second results to a second predetermined register in the same the sequence as it received the second results from the first calculation circuitry.
    • 数据处理器具有第一计算电路(26),重命名缓冲器(34)和队列(36)。 第一计算电路从提供的操作数和接收的编程指令产生第一和第二结果。 重命名缓冲器耦合到第一计算电路并存储从第一计算电路接收的一系列第一结果。 重命名缓冲器将一系列第一结果输出到第一预定寄存器。 队列还耦合到第一计算电路并存储一系列第二结果。 队列以与从第一计算电路接收到第二结果的顺序相同的顺序将第二结果的序列输出到第二预定寄存器。