会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明申请
    • Technique for preserving memory affinity in a non-uniform memory access data processing system
    • 在不均匀的存储器访问数据处理系统中保存记忆亲和性的技术
    • US20120198187A1
    • 2012-08-02
    • US13015733
    • 2011-01-28
    • Mathew AccapadiRobert H. Bell, JR.Men-Chow ChiangHong L. Hua
    • Mathew AccapadiRobert H. Bell, JR.Men-Chow ChiangHong L. Hua
    • G06F12/12G06F12/08
    • G06F9/5016G06F9/5088G06F2212/2542Y02D10/22Y02D10/32
    • Techniques for preserving memory affinity in a computer system is disclosed. In response to a request for memory access to a page within a memory affinity domain, a determination is made if the request is initiated by a processor associated with the memory affinity domain. If the request is not initiated by a processor associated with the memory affinity domain, a determination is made if there is a page ID match with an entry within a page migration tracking module associated with the memory affinity domain. If there is no page ID match, an entry is selected within the page migration tracking module to be updated with a new page ID and a new memory affinity ID. If there is a page ID match, then another determination is made whether or not there is a memory affinity ID match with the entry with the page ID field match. If there is no memory affinity ID match, the entry is updated with a new memory affinity ID; and if there is a memory affinity ID match, an access counter of the entry is incremented.
    • 公开了一种用于在计算机系统中保存记忆亲和性的技术。 响应于对存储器相关域中的页面的存储器访问的请求,确定该请求是否由与存储器相关域相关联的处理器发起。 如果请求不是由与存储器相关性域相关联的处理器发起,则确定是否存在与存储器相关域相关联的页面迁移跟踪模块内的条目的页面ID匹配。 如果没有页面ID匹配,则在页面迁移跟踪模块中选择要更新新页面ID和新的内存关联ID的条目。 如果存在页面ID匹配,则另外确定存储器相关性ID是否与页面ID字段匹配的条目匹配。 如果没有内存关联ID匹配,则该条目将使用新的内存关联ID更新; 并且如果存在存储器相关性ID匹配,则增加该条目的访问计数器。
    • 15. 发明申请
    • EFFICIENT STORAGE OF INDIVIDUALS FOR OPTIMIZATION SIMULATION
    • 有效存储个人优化模拟
    • US20120130928A1
    • 2012-05-24
    • US12948850
    • 2010-11-18
    • Robert H. Bell, JR.Jason F. Cantin
    • Robert H. Bell, JR.Jason F. Cantin
    • G06N3/12G06F15/18
    • 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.
    • 优化问题的候选解决方案包括可以应用于问题描述中的变量的一组潜在值。 候选解决方案可能很大,因为优化问题和大量变量的复杂性。 候选解决方案的人数也可能很大,以确保计算解决方案的多样性和有效性。 当人口和候选解决方案对于优化问题很大时,计算优化问题的解决方案会消耗大量的内存。 在某些情况下,几代候选解决方案存储在内存中。 压缩候选解决方案可以最大限度地减少计算优化问题解决方案所消耗的内存空间。