会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 53. 发明授权
    • Data structure supporting random delete and timer function
    • 数据结构支持随机删除和定时功能
    • US07792873B2
    • 2010-09-07
    • US12015198
    • 2008-01-16
    • Gordon T. DavisMarco HeddesDongming Hwang
    • Gordon T. DavisMarco HeddesDongming Hwang
    • G06F17/30G06F7/00
    • G06F17/30955Y10S707/99933Y10S707/99942
    • A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.
    • 一个过程用于提供处理大量活动数据条目的数据结构以及高活动条目的添加和删除率。 该过程利用以下一个或多个修改。 定时器从单个会话表条目中删除,并通过指针进行链接。 在会话表和定时器结构之间建立双向链路。 老化/定时器检查应用于定时器控制块(TCB)。 可以使用可选地包括多余块的TCB链,以及将多个TCB打包到单个存储器位置中。 这个多余的块允许终止的会话继续占用TCB,直到定时器进程前进到块链中的块位置。
    • 55. 发明授权
    • 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.
    • 一种用于提高缓存性能的方法和系统。 高速缓存可以包括标签条目的阵列,其中每个标签条目包括用于指示其相关联的高速缓存行是否被重用,即被处理器请求或引用的附加位(“重用位”)。 通过跟踪高速缓存行是否被重用,在替换可被重用的数据(高速缓存行)之前,可以用新的传入高速缓存行替换可能不被重用的数据(高速缓存行)。 通过在替换可能被重用的数据之前替换高速缓冲存储器中可能不被重用的数据,可以提高高速缓存命中,从而提高性能。
    • 59. 发明授权
    • 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.