会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明申请
    • System and method for employing a process identifier to minimize aliasing in a linear-addressed cache
    • 用于使用进程标识符来最小化线性寻址高速缓存中的混叠的系统和方法
    • US20050027963A1
    • 2005-02-03
    • US10917449
    • 2004-08-13
    • Herbert HumStephan JourdanPer Hammarlund
    • Herbert HumStephan JourdanPer Hammarlund
    • G06F12/10G06F12/08
    • G06F12/1054G06F12/1063G06F12/109
    • A system and method for reducing linear address aliasing is described. In one embodiment, a portion of a linear address is combined with a process identifier, e.g., a page directory base pointer to form an adjusted-linear address. The page directory base pointer is unique to a process and combining it with a portion of the linear address produces an adjusted-linear address that provides a high probability of no aliasing. A portion of the adjusted-linear address is used to search an adjusted-linear-addressed cache memory for a data block specified by the linear address. If the data block does not reside in the adjusted-linear-addressed cache memory, then a replacement policy selects one of the cache lines in the adjusted-linear-addressed cache memory and replaces the data block of the selected cache line with a data block located at a physical address produced from translating the linear address. The tag for the cache line selected is a portion of the adjusted linear address and the physical address produced from translating the linear address.
    • 描述了用于减少线性地址混叠的系统和方法。 在一个实施例中,线性地址的一部分与进程标识符(例如,页目录基本指针)组合以形成调整后的线性地址。 页面目录基本指针对于进程是唯一的,并且将其与线性地址的一部分组合产生调整的线性地址,其提供没有别名的高概率。 调整后的线性地址的一部分用于搜索由线性地址指定的数据块的经调整的线性寻址高速缓冲存储器。 如果数据块不在调整后的线性寻址高速缓冲存储器中,则替换策略选择调整后的线性寻址高速缓存存储器中的一条高速缓存行,并用数据块替换所选择的高速缓存线的数据块 位于从翻译线性地址产生的物理地址。 所选择的高速缓存线的标签是调整后的线性地址的一部分和通过转换线性地址产生的物理地址。
    • 29. 发明申请
    • Compressing and accessing a microcode ROM
    • 压缩和访问微码ROM
    • US20070022279A1
    • 2007-01-25
    • US11186240
    • 2005-07-20
    • Youfeng WuSangwook KimMauricio BreternitzHerbert Hum
    • Youfeng WuSangwook KimMauricio BreternitzHerbert Hum
    • G06F9/44
    • G06F12/06G06F8/4436G06F9/30178G06F2212/401
    • An arrangement is provided for compressing microcode ROM (“uROM”) in a processor and for efficiently accessing a compressed “uROM”. A clustering-based approach may be used to effectively compress a uROM. The approach groups similar columns of microcode into different clusters and identifies unique patterns within each cluster. Only unique patterns identified in each cluster are stored in a pattern storage. Indices, which help map an address of a microcode word (“uOP”) to be fetched from a uROM to unique patterns required for the uOP, may be stored in an index storage. Typically it takes a longer time to fetch a uOP from a compressed uROM than from an uncompressed uROM. The compressed uROM may be so designed that the process of fetching a uOP (or uOPs) from a compressed uROM may be fully-pipelined to reduce the access latency.
    • 提供了一种用于在处理器中压缩微代码ROM(“uROM”)并有效访问压缩的“uROM”的装置。 可以使用基于聚类的方法来有效地压缩uROM。 该方法将相似的微代码列组合成不同的集群,并识别每个集群内的唯一模式。 每个集群中唯一标识的模式都存储在模式存储中。 帮助将从uROM获取的微代码字(“uOP”)的地址映射到uOP所需的唯一模式的索引可以存储在索引存储器中。 通常,从压缩的uROM获取uop比从未压缩的uROM获取更长的时间。 压缩的uROM可以被设计成使得从压缩的uROM获取uop(或uop)的过程可以被完全流水线化以减少访问等待时间。