专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08122223B2 Access speculation predictor with predictions based on memory region prior requestor tag information 有权
标题翻译：基于存储区域先前请求者标签信息的预测访问推测预测器
公开(公告)号：US08122223B2
公开(公告)日：2012-02-21
申请号：US12105401
申请日：2008-04-18
申请人： Jason F. Cantin , Richard Nicholas , Eric E. Retter , Jeffrey A. Stuecheli
发明人： Jason F. Cantin , Richard Nicholas , Eric E. Retter , Jeffrey A. Stuecheli
IPC分类号： G06F12/00 , G06F9/26 , G06F9/34
CPC分类号： G06F12/0862 , G06F12/0831 , G06F2212/1016 , Y02D10/13
摘要： An access speculation predictor may predict whether to perform speculative retrieval of data for a data request from a main memory based on whether or not a current requestor tag matches a previous requestor tag. In particular, a first address and a first requester tag may be extracted from a first data request and a finite state machine (FSM) of a memory controller may be selected whose memory region includes the first address. A second requester tag, that identifies a previous requester that attempted to access the memory region association with the selected FSM, may be retrieved from a register associated with the selected FSM and compared to the first requester tag. Speculatively retrieving the data for the first data request from a main memory may be controlled based on results of the comparison of the first requester tag to the second requester tag.
摘要翻译：访问推测预测器可以基于当前请求者标签是否匹配先前的请求者标签来预测是否对来自主存储器的数据请求的数据进行推测检索。特别地，可以从第一数据请求中提取第一地址和第一请求者标签，并且可以选择存储器控制器的有限状态机（FSM），其存储器区域包括第一地址。可以从与所选FSM相关联的寄存器中检索识别尝试访问与选择的FSM的存储器区域关联的先前请求者的第二请求者标签，并与第一请求者标签进行比较。可以基于第一请求者标签与第二请求者标签的比较的结果来控制从主存储器推测地检索第一数据请求的数据。

2. 发明申请

US20090327619A1 Access Speculation Predictor with Predictions Based on Memory Region Prior Requestor Tag Information 有权
标题翻译：基于内存区域预先请求者标签信息的预测访问推测预测器
公开(公告)号：US20090327619A1
公开(公告)日：2009-12-31
申请号：US12105401
申请日：2008-04-18
申请人： Jason F. Cantin , Richard Nicholas , Eric E. Retter , Jeffrey A. Stuecheli
发明人： Jason F. Cantin , Richard Nicholas , Eric E. Retter , Jeffrey A. Stuecheli
IPC分类号： G06F12/00
CPC分类号： G06F12/0862 , G06F12/0831 , G06F2212/1016 , Y02D10/13
摘要： An access speculation predictor may predict whether to perform speculative retrieval of data for a data request from a main memory based on whether or not a current requestor tag matches a previous requestor tag. In particular, a first address and a first requester tag may be extracted from a first data request and a finite state machine (FSM) of a memory controller may be selected whose memory region includes the first address. A second requester tag, that identifies a previous requester that attempted to access the memory region association with the selected FSM, may be retrieved from a register associated with the selected FSM and compared to the first requester tag. Speculatively retrieving the data for the first data request from a main memory may be controlled based on results of the comparison of the first requester tag to the second requester tag.
摘要翻译：访问推测预测器可以基于当前请求者标签是否匹配先前的请求者标签来预测是否对来自主存储器的数据请求的数据进行推测检索。特别地，可以从第一数据请求中提取第一地址和第一请求者标签，并且可以选择存储器控制器的有限状态机（FSM），其存储器区域包括第一地址。可以从与所选FSM相关联的寄存器中检索识别尝试访问与选择的FSM的存储器区域关联的先前请求者的第二请求者标签，并与第一请求者标签进行比较。可以基于第一请求者标签与第二请求者标签的比较的结果来控制从主存储器推测地检索第一数据请求的数据。

3. 发明授权

US08515882B2 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
IPC分类号： G06F15/18 , G06N3/00 , G06N3/12
CPC分类号： 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.
摘要翻译：优化问题的候选解决方案包括可以应用于问题描述中的变量的一组潜在值。候选解决方案可能很大，因为优化问题和大量变量的复杂性。候选解决方案的人数也可能很大，以确保计算解决方案的多样性和有效性。当人口和候选解决方案对于优化问题很大时，计算优化问题的解决方案会消耗大量的内存。在某些情况下，几代候选解决方案存储在内存中。压缩候选解决方案可以最大限度地减少计算优化问题解决方案所消耗的内存空间。

4. 发明授权

US08370584B2 Predictive ownership control of shared memory computing system data 有权
标题翻译：共享内存计算系统数据的预测所有权控制
公开(公告)号：US08370584B2
公开(公告)日：2013-02-05
申请号：US13530857
申请日：2012-06-22
申请人： Jason F. Cantin , Steven R. Kunkel
发明人： Jason F. Cantin , Steven R. Kunkel
IPC分类号： G06F12/00
CPC分类号： G06F12/084 , G06F9/528 , G06F12/0842 , G06F12/126 , G06F2212/1016
摘要： A method, circuit arrangement, and design structure utilize a lock prediction data structure to control ownership of a cache line in a shared memory computing system. In a first node among the plurality of nodes, lock prediction data in a hardware-based lock prediction data structure for a cache line associated with a first memory request is updated in response to that first memory request, wherein at least a portion of the lock prediction data is predictive of whether the cache line is associated with a release operation. The lock prediction data is then accessed in response to a second memory request associated with the cache line and issued by a second node and a determination is made as to whether to transfer ownership of the cache line from the first node to the second node based at least in part on the accessed lock prediction data.
摘要翻译：方法，电路布置和设计结构利用锁预测数据结构来控制共享存储器计算系统中的高速缓存行的所有权。在所述多个节点中的第一节点中，响应于所述第一存储器请求来更新与用于与第一存储器请求相关联的高速缓存行的基于硬件的锁预测数据结构中的预测数据锁定，其中所述锁的至少一部分预测数据预测高速缓存行是否与释放操作相关联。然后，锁定预测数据被响应于与高速缓存线相关联并由第二节点发出的第二存储器请求而被访问，并且基于在第二节点处是否将高速缓存行的所有权从第一节点转移到第二节点进行确定至少部分地基于所访问的锁定预测数据。

5. 发明申请

US20120265942A1 PREDICTIVE OWNERSHIP CONTROL OF SHARED MEMORY COMPUTING SYSTEM DATA 有权
标题翻译：共享内存计算系统数据的预测所有权控制
公开(公告)号：US20120265942A1
公开(公告)日：2012-10-18
申请号：US13530857
申请日：2012-06-22
申请人： Jason F. Cantin , Steven R. Kunkel
发明人： Jason F. Cantin , Steven R. Kunkel
IPC分类号： G06F12/08
CPC分类号： G06F12/084 , G06F9/528 , G06F12/0842 , G06F12/126 , G06F2212/1016
摘要： A method, circuit arrangement, and design structure utilize a lock prediction data structure to control ownership of a cache line in a shared memory computing system. In a first node among the plurality of nodes, lock prediction data in a hardware-based lock prediction data structure for a cache line associated with a first memory request is updated in response to that first memory request, wherein at least a portion of the lock prediction data is predictive of whether the cache line is associated with a release operation. The lock prediction data is then accessed in response to a second memory request associated with the cache line and issued by a second node and a determination is made as to whether to transfer ownership of the cache line from the first node to the second node based at least in part on the accessed lock prediction data.
摘要翻译：方法，电路布置和设计结构利用锁预测数据结构来控制共享存储器计算系统中的高速缓存行的所有权。在所述多个节点中的第一节点中，响应于所述第一存储器请求来更新与用于与第一存储器请求相关联的高速缓存行的基于硬件的锁预测数据结构中的预测数据锁定，其中所述锁的至少一部分预测数据预测高速缓存行是否与释放操作相关联。然后，锁定预测数据被响应于与高速缓存线相关联并由第二节点发出的第二存储器请求而被访问，并且基于在第二节点处是否将高速缓存行的所有权从第一节点转移到第二节点进行确定至少部分地基于所访问的锁定预测数据。

6. 发明授权

US08285942B2 Region coherence array having hint bits for a clustered shared-memory multiprocessor system 有权
标题翻译：具有用于集群共享存储器多处理器系统的提示位的区域相干阵列
公开(公告)号：US08285942B2
公开(公告)日：2012-10-09
申请号：US12360129
申请日：2009-01-27
申请人： Jason F. Cantin
发明人： Jason F. Cantin
IPC分类号： G06F13/00
CPC分类号： G06F12/0811 , G06F12/0815 , G06F12/084
摘要： A system and method for a multilevel region coherence protocol for use in Region Coherence Arrays (RCAs) deployed in clustered shared-memory multiprocessor systems which optimize cache-to-cache transfers (interventions) by using region hint bits in each RCA to allow memory requests for lines of a region of the memory to be optimally sent to only a determined portion of the clustered shared-memory multiprocessor system without broadcasting the requests to all processors in the system. A sufficient number of region hint bits are used to uniquely identify each level of the system's interconnect hierarchy to optimally predict which level of the system likely includes a processor that has cached copies of lines of data from the region.
摘要翻译：一种用于多层次区域相干协议的系统和方法，用于部署在群集共享存储器多处理器系统中的区域相干阵列（RCA），其通过使用每个RCA中的区域提示位来优化缓存到缓存传输（干预），以允许存储器请求用于存储器的区域的行被最优化地发送到集群共享存储器多处理器系统的确定部分，而不向系统中的所有处理器广播请求。足够数量的区域提示位用于唯一地标识系统的互连层次结构的每个级别，以最佳地预测系统的哪个级别可能包括已经从该区域缓存数据行的副本的处理器。

7. 发明申请

US20120130928A1 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
IPC分类号： G06N3/12 , G06F15/18
CPC分类号： 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.
摘要翻译：优化问题的候选解决方案包括可以应用于问题描述中的变量的一组潜在值。候选解决方案可能很大，因为优化问题和大量变量的复杂性。候选解决方案的人数也可能很大，以确保计算解决方案的多样性和有效性。当人口和候选解决方案对于优化问题很大时，计算优化问题的解决方案会消耗大量的内存。在某些情况下，几代候选解决方案存储在内存中。压缩候选解决方案可以最大限度地减少计算优化问题解决方案所消耗的内存空间。

8. 发明申请

US20080215821A1 DATA PROCESSING SYSTEM AND METHOD FOR EFFICIENT COMMUNICATION UTILIZING AN IN COHERENCY STATE 有权
标题翻译：数据处理系统和方法，用于高效率通信
公开(公告)号：US20080215821A1
公开(公告)日：2008-09-04
申请号：US12103564
申请日：2008-04-15
申请人： Jason F. Cantin , James S. Fields , Steven R. Kunkel , William J. Starke
发明人： Jason F. Cantin , James S. Fields , Steven R. Kunkel , William J. Starke
IPC分类号： G06F12/08
CPC分类号： G06F12/0831 , G06F12/0811 , G06F12/0813
摘要： A cache coherent data processing system includes at least first and second coherency domains each including at least one processing unit. The first coherency domain includes a first cache memory, and the second coherency domain includes a coherent second cache memory. The first cache memory within the first coherency domain of the data processing system holds a memory block in a storage location associated with an address tag and a coherency state field. The coherency state field is set to a state that indicates that the address tag is valid, that the storage location does not contain valid data, and that the memory block is likely cached only within the first coherency domain.
摘要翻译：高速缓存一致数据处理系统至少包括第一和第二相关域，每个域包括至少一个处理单元。第一相关域包括第一高速缓冲存储器，并且第二相干域包括相干第二高速缓冲存储器。数据处理系统的第一相干域内的第一高速缓冲存储器在与地址标签和一致性状态字段相关联的存储位置中保存存储器块。相关性状态字段被设置为指示地址标签有效的状态，存储位置不包含有效数据，并且该存储器块可能仅在第一相干域内被缓存。

9. 发明授权

US09165248B2 Using global and local catastrophes across sub-populations in parallel evolutionary computing 有权
公开(公告)号：US09165248B2
公开(公告)日：2015-10-20
申请号：US13593850
申请日：2012-08-24
申请人： Jason F. Cantin
发明人： Jason F. Cantin
IPC分类号： G06F15/18 , G06N3/12
CPC分类号： G06N3/12 , G06N3/126
摘要： A parallel genetic algorithm computing process tracks forward progress of a first sub-population across generations thereof. The first sub-population is one of a plurality of sub-populations that form a population of candidate solutions to an optimization problem. At a current generation of the first sub-population, it is determined that forward progress of the first sub-population fails a set of one or more forward progress criteria. In response to determining that the forward progress of the first sub-population fails the set of one or more forward progress criteria at the current generation, a local catastrophe is invoked on the current generation of the first sub-population. The first sub-population is re-populated after the local catastrophe is invoked. The first sub-population is re-established after re-populating while constraining migration to the first sub-population.

10. 发明授权

US09165247B2 Using global and local catastrophes across sub-populations in parallel evolutionary computing 有权
标题翻译：在并行进化计算中使用亚群体的全球和当地灾难
公开(公告)号：US09165247B2
公开(公告)日：2015-10-20
申请号：US13343558
申请日：2012-01-04
申请人： Jason F. Cantin
发明人： Jason F. Cantin
IPC分类号： G06N3/12
CPC分类号： G06N3/12 , G06N3/126
摘要： A parallel genetic algorithm computing process tracks forward progress of a first sub-population across generations thereof. The first sub-population is one of a plurality of sub-populations that form a population of candidate solutions to an optimization problem. At a current generation of the first sub-population, it is determined that forward progress of the first sub-population fails a set of one or more forward progress criteria. In response to determining that the forward progress of the first sub-population fails the set of one or more forward progress criteria at the current generation, a local catastrophe is invoked on the current generation of the first sub-population. The first sub-population is re-populated after the local catastrophe is invoked. The first sub-population is re-established after re-populating while constraining migration to the first sub-population.
摘要翻译：并行遗传算法计算过程跟踪第一个子群体跨代的进展。第一个子群体是形成优化问题的候选解决方案群体的多个子群体之一。在当前一代第一子群体中，确定第一子群体的向前进展失败了一组或多个前进进度标准。为了确定第一批次人口的进步未能在当前一代的一个或多个前进进展标准的集合中，在当前一代的第一批人群中援引本地灾难。在调用本地灾难后，第一批次人口重新居住。第一批人口在重新填充后重新建立，同时限制了向第一批次人口的迁移。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式