会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 36. 发明授权
    • Method and apparatus for minimizing cache conflict misses
    • 用于最小化缓存冲突漏洞的方法和装置
    • US08751751B2
    • 2014-06-10
    • US13015771
    • 2011-01-28
    • Robert H. Bell, Jr.Men-Chow ChiangHong L. Hua
    • Robert H. Bell, Jr.Men-Chow ChiangHong L. Hua
    • G06F12/00G06F12/08G06F12/10
    • G06F12/0864G06F12/1018G06F12/1036
    • A method for minimizing cache conflict misses is disclosed. A translation table capable of facilitating the translation of a virtual address to a real address during a cache access is provided. The translation table includes multiple entries, and each entry of the translation table includes a page number field and a hash value field. A hash value is generated from a first group of bits within a virtual address, and the hash value is stored in the hash value field of an entry within the translation table. In response to a match on the entry within the translation table during a cache access, the hash value of the matched entry is retrieved from the translation table, and the hash value is concatenated with a second group of bits within the virtual address to form a set of indexing bits to index into a cache set.
    • 公开了一种最小化缓存冲突漏洞的方法。 提供了一种能够有助于在高速缓存访​​问期间将虚拟地址转换为真实地址的转换表。 翻译表包括多个条目,并且翻译表的每个条目包括页码字段和散列值字段。 从虚拟地址内的第一组比特生成哈希值,并将哈希值存储在转换表内的条目的哈希值字段中。 响应于高速缓存访​​问期间在转换表内的条目的匹配,从转换表中检索匹配条目的散列值,并且将散列值与虚拟地址中的第二组位相连,以形成 一组索引位索引到高速缓存集中。
    • 39. 发明授权
    • Efficient storage of individuals for optimization simulation
    • 有效存储个人进行优化模拟
    • US08515882B2
    • 2013-08-20
    • US12948850
    • 2010-11-18
    • Robert H. Bell, Jr.Jason F. Cantin
    • Robert H. Bell, Jr.Jason F. Cantin
    • G06F15/18G06N3/00G06N3/12
    • G06N3/126
    • Candidate solutions to an optimization problem comprise a set of potential values that can be applied to variables in a problem description. Candidate solutions can be large because of the complexity of optimization problems and large number of variables. The populations of candidate solutions may also be large to ensure diversity and effectiveness in computing a solution. When the populations and the candidate solutions are large for an optimization problem, computing a solution to the optimization problem consumes a large amount of memory. In some instances, several generations of candidate solutions are stored in memory. Compression of the candidate solutions can minimize the memory space consumed to compute a solution to an optimization problem.
    • 优化问题的候选解决方案包括可以应用于问题描述中的变量的一组潜在值。 候选解决方案可能很大,因为优化问题和大量变量的复杂性。 候选解决方案的人数也可能很大,以确保计算解决方案的多样性和有效性。 当人口和候选解决方案对于优化问题很大时,计算优化问题的解决方案会消耗大量的内存。 在某些情况下,几代候选解决方案存储在内存中。 压缩候选解决方案可以最大限度地减少计算优化问题解决方案所消耗的内存空间。