会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明授权
    • DRAM access command queuing
    • DRAM访问命令排队
    • US07913034B2
    • 2011-03-22
    • US11832220
    • 2007-08-01
    • Jean L. CalvignacChih-jen ChangGordon T. DavisFabrice J. Verplanken
    • Jean L. CalvignacChih-jen ChangGordon T. DavisFabrice J. Verplanken
    • G06F12/00
    • G06F13/1642
    • Access arbiters are used to prioritize read and write access requests to individual memory banks in DRAM memory devices, particularly fast cycle DRAMs. This serves to optimize the memory bandwidth available for the read and the write operations by avoiding consecutive accesses to the same memory bank and by minimizing dead cycles. The arbiter first divides DRAM accesses into write accesses and read accesses. The access requests are divided into accesses per memory bank with a threshold limit imposed on the number of accesses to each memory bank. The write receive packets are rotated among the banks based on the write queue status. The status of the write queue for each memory bank may also be used for system flow control. The arbiter also typically includes the ability to determine access windows based on the status of the command queues, and to perform arbitration on each access window.
    • 访问仲裁器被用于将对DRAM存储器件,特别是快速循环DRAM中的各个存储体的读取和写入访问请求进行优先级排序。 这用于通过避免对同一存储体的连续访问并且通过最小化死循环来优化用于读取和写入操作的存储器带宽。 仲裁器首先将DRAM访问划分为写访问和读访问。 访问请求被划分为每个存储体的访问,并且对每个存储体的访问次数施加了阈值限制。 基于写入队列状态,写入接收数据包在存储体之间旋转。 每个存储体的写入队列的状态也可以用于系统流控制。 仲裁器还通常包括基于命令队列的状态来确定访问窗口的能力,并且在每个访问窗口上执行仲裁。
    • 53. 发明授权
    • Performance of a cache by detecting cache lines that have been reused
    • 通过检测已被重用的高速缓存行来执行缓存的性能
    • US07380065B2
    • 2008-05-27
    • US11094399
    • 2005-03-30
    • Gordon T. DavisSantiago A. LeonHans-Werner Tast
    • Gordon T. DavisSantiago A. LeonHans-Werner Tast
    • G06F13/00
    • G06F12/127
    • A method and system for improving the performance of a cache. The cache may include an array of tag entries where each tag entry includes an additional bit (“reused bit”) used to indicate whether its associated cache line has been reused, i.e., has been requested or referenced by the processor. By tracking whether a cache line has been reused, data (cache line) that may not be reused may be replaced with the new incoming cache line prior to replacing data (cache line) that may be reused. By replacing data in the cache memory that might not be reused prior to replacing data that might be reused, the cache hit may be improved thereby improving performance.
    • 一种用于提高缓存性能的方法和系统。 高速缓存可以包括标签条目的阵列,其中每个标签条目包括用于指示其相关联的高速缓存行是否被重用,即被处理器请求或引用的附加位(“重用位”)。 通过跟踪高速缓存行是否被重用,在替换可被重用的数据(高速缓存行)之前,可以用新的传入高速缓存行替换可能不被重用的数据(高速缓存行)。 通过在替换可能被重用的数据之前替换高速缓冲存储器中可能不被重用的数据,可以提高高速缓存命中,从而提高性能。
    • 57. 发明授权
    • Programmable priority branch circuit
    • 可编程优先支路
    • US4972342A
    • 1990-11-20
    • US254985
    • 1988-10-07
    • Gordon T. DavisBaiju D. Mandalia
    • Gordon T. DavisBaiju D. Mandalia
    • G06F9/32G06F9/38G06F9/48
    • G06F9/3885G06F9/30058G06F9/30094G06F9/3804
    • A special purpose circuit unit, responsive to a special BBD instruction, provides for more efficient execution of program branches required in poll and test type routines used by data processors. This unit can easily be added to almost any contemporary processing system to speed up performance of priority branch operations. It includes: a stack of registers loadable with branch addresses designating locations of branch target instructions, an input register for holding bits representing branch conditions accessible from immediate (programmable) storage, and a programmable priority encoder responsive to the BBD instruction to select an address from the stack in accordance with the position in the input register of a highest priority one of the bits representing an active request for instruction branching. The selected address is used to fetch an instruction representing the start of a program segment for attending to the selected branch condition. Contents of the branch address stack are alterable by program to allow for varying selections of branch routines to fulfill conditions denotable by different sets of bits loadable into the input register. The priority encoder includes a stack of selection control registers which are also loadable by programs, to allow for variability in the priority ordering accorded to the bit positions of the input register. By dynamically loading information into the branch address and priority selection stacks, subject BBD unit can be shared dynamically for resolving sequence branching relative to multiple different classes of conditions or events depending on system requirements. The unit is configurable to execute its priority and branch address selection operations together in a single clock cycle of the system. In pipelined systems, the BBD function can be conveniently accommodated in parallel with other system functions.