公开(公告)号：US20160139624A1

公开(公告)日：2016-05-19

申请号：US14542042

申请日：2014-11-14

Applicant: Advanced Micro Devices, Inc.

Inventor： Marc S. Orr ,  Bradford M. Beckmann ,  Ayse Yilmazer ,  Shuai Che ,  David A. Wood ,  Mark D. Hill

IPC: G06F1/12

CPC classification number: G06F9/46 ,  G06F3/06 ,  G06F12/0806 ,  G06F12/0871 ,  G06F2212/222 ,  G06F2212/313 ,  G06F2212/401

Abstract: Described herein is an apparatus and method for remote scoped synchronization, which is a new semantic that allows a work-item to order memory accesses with a scope instance outside of its scope hierarchy. More precisely, remote synchronization expands visibility at a particular scope to all scope-instances encompassed by that scope. Remote scoped synchronization operation allows smaller scopes to be used more frequently and defers added cost to only when larger scoped synchronization is required. This enables programmers to optimize the scope that memory operations are performed at for important communication patterns like work stealing. Executing memory operations at the optimum scope reduces both execution time and energy. In particular, remote synchronization allows a work-item to communicate with a scope that it otherwise would not be able to access. Specifically, work-items can pull valid data from and push updates to scopes that do not (hierarchically) contain them.

Abstract translation: 这里描述的是一种用于远程作用域同步的装置和方法，它是一种新的语义，其允许工作项目使用其范围层级之外的范围实例来排序存储器访问。 更准确地说，远程同步将特定范围的可见性扩展到该范围包含的所有范围实例。 远程作用域同步操作允许更频繁地使用较小的范围，并且只有在需要较大的范围同步时才会降低增加的成本。 这使程序员可以优化执行存储器操作的范围，以便重要的通信模式，如工作窃取。 以最佳范围执行内存操作可以减少执行时间和能量。 特别地，远程同步允许工作项目与否则将无法访问的范围进行通信。 具体来说，工作项可以从不（分级）包含它们的范围提取有效的数据并将更新推送到范围。

公开(公告)号：US20140143495A1

公开(公告)日：2014-05-22

申请号：US13946112

申请日：2013-07-19

Applicant: Advanced Micro Devices, Inc.

Inventor： Lena E. Olson ,  Yasuko Eckert ,  Vilas K. Sridharan ,  James M. O'Connor ,  Mark D. Hill ,  Srilatha Manne

IPC: G06F12/08

CPC classification number: G06F12/0802 ,  G06F12/0848 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/123 ,  G06F2212/1016 ,  G06F2212/1028 ,  G06F2212/451 ,  G06F2212/502 ,  G06F2212/601 ,  G06F2212/6032 ,  G06F2212/6082 ,  Y02D10/13

Abstract: A method of partitioning a data cache comprising a plurality of sets, the plurality of sets comprising a plurality of ways, is provided. Responsive to a stack data request, the method stores a cache line associated with the stack data in one of a plurality of designated ways of the data cache, wherein the plurality of designated ways is configured to store all requested stack data.

Abstract translation: 提供了一种分割包括多个集合的数据高速缓存的方法，所述多个集合包括多个方式。 响应于堆栈数据请求，该方法将与堆栈数据相关联的高速缓存行存储在数据高速缓存的多个指定方式之一中，其中多个指定路径被配置为存储所有请求的堆栈数据。

公开(公告)号：US09804883B2

公开(公告)日：2017-10-31

申请号：US14542042

申请日：2014-11-14

Applicant: Advanced Micro Devices, Inc.

Inventor： Marc S. Orr ,  Bradford M. Beckmann ,  Ayse Yilmazer ,  Shuai Che ,  David A. Wood ,  Mark D. Hill

IPC: G06F9/46 ,  G06F12/0806 ,  G06F3/06 ,  G06F12/0871

CPC classification number: G06F9/46 ,  G06F3/06 ,  G06F12/0806 ,  G06F12/0871 ,  G06F2212/222 ,  G06F2212/313 ,  G06F2212/401

Abstract: Described herein is an apparatus and method for remote scoped synchronization, which is a new semantic that allows a work-item to order memory accesses with a scope instance outside of its scope hierarchy. More precisely, remote synchronization expands visibility at a particular scope to all scope-instances encompassed by that scope. Remote scoped synchronization operation allows smaller scopes to be used more frequently and defers added cost to only when larger scoped synchronization is required. This enables programmers to optimize the scope that memory operations are performed at for important communication patterns like work stealing. Executing memory operations at the optimum scope reduces both execution time and energy. In particular, remote synchronization allows a work-item to communicate with a scope that it otherwise would not be able to access. Specifically, work-items can pull valid data from and push updates to scopes that do not (hierarchically) contain them.

公开(公告)号：US09361118B2

公开(公告)日：2016-06-07

申请号：US14275271

申请日：2014-05-12

Applicant: Advanced Micro Devices, Inc.

Inventor： Derek R. Hower ,  Mark D. Hill ,  David Wood ,  Steven K. Reinhardt ,  Benedict R. Gaster ,  Blake A. Hechtman ,  Bradford M. Beckmann

IPC: G06F12/00 ,  G06F9/44 ,  G06F9/52

CPC classification number: G06F9/44 ,  G06F8/436 ,  G06F8/454 ,  G06F9/52 ,  G06F9/522 ,  G06F9/524 ,  G06F9/526

Abstract: A method, computer program product, and system is described that determines the correctness of using memory operations in a computing device with heterogeneous computer components. Embodiments include an optimizer based on the characteristics of a Sequential Consistency for Heterogeneous-Race-Free (SC for HRF) model that analyzes a program and determines the correctness of the ordering of events in the program. HRF models include combinations of the properties: scope order, scope inclusion, and scope transitivity. The optimizer can determine when a program is heterogeneous-race-free in accordance with an SC for HRF memory consistency model. For example, the optimizer can analyze a portion of program code, respect the properties of the SC for HRF model, and determine whether a value produced by a store memory event will be a candidate for a value observed by a load memory event. In addition, the optimizer can determine whether reordering of events is possible.

Abstract translation: 描述了一种方法，计算机程序产品和系统，其确定在具有异构计算机组件的计算设备中使用存储器操作的正确性。 实施例包括基于用于异构无竞争（SC for HRF）的顺序一致性的特性的优化器，该模型分析程序并确定程序中的事件的顺序的正确性。 HRF模型包括属性的组合：范围顺序，范围包含和范围传递性。 优化器可以根据HR对HRF内存一致性模型的SC来确定程序何时是异构无竞争的。 例如，优化器可以分析程序代码的一部分，尊重SC的HRF模型的属性，并且确定由存储器存储器事件产生的值是否将是由加载存储器事件观察到的值的候选。 此外，优化器可以确定是否可能重新排序事件。

公开(公告)号：US20140143498A1

公开(公告)日：2014-05-22

申请号：US13945620

申请日：2013-07-18

Applicant: ADVANCED MICRO DEVICES, INC.

Inventor： Lena E. Olson ,  Yasuko Eckert ,  Vilas K. Sridharan ,  James M. O'Connor ,  Mark D. Hill ,  Srilatha Manne

IPC: G06F12/08

CPC classification number: G06F12/0802 ,  G06F12/08 ,  G06F12/0804 ,  G06F12/0811 ,  G06F12/0815 ,  G06F12/0848 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/1036 ,  G06F12/123 ,  G06F2212/1016 ,  G06F2212/1028 ,  G06F2212/451 ,  G06F2212/6032 ,  G06F2212/683 ,  G06F2212/684 ,  Y02B60/1225 ,  Y02D10/13

Abstract: A method of storing stack data in a cache hierarchy is provided. The cache hierarchy comprises a data cache and a stack filter cache. Responsive to a request to access a stack data block, the method stores the stack data block in the stack filter cache, wherein the stack filter cache is configured to store any requested stack data block.

Abstract translation: 提供了将堆栈数据存储在高速缓存层级中的方法。 缓存层级包括数据高速缓存和堆栈过滤器高速缓存。 响应于访问堆栈数据块的请求，该方法将堆栈数据块存储在堆栈过滤器高速缓存中，其中堆叠过滤器高速缓存被配置为存储任何所请求的栈数据块。

公开(公告)号：US09298615B2

公开(公告)日：2016-03-29

申请号：US13946112

申请日：2013-07-19

Applicant: ADVANCED MICRO DEVICES, INC.

Inventor： Lena E. Olson ,  Yasuko Eckert ,  Vilas K. Sridharan ,  James M. O'Connor ,  Mark D. Hill ,  Srilatha Manne

IPC: G06F12/08 ,  G06F12/12

CPC classification number: G06F12/0802 ,  G06F12/0848 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/123 ,  G06F2212/1016 ,  G06F2212/1028 ,  G06F2212/451 ,  G06F2212/502 ,  G06F2212/601 ,  G06F2212/6032 ,  G06F2212/6082 ,  Y02D10/13

Abstract: A method of partitioning a data cache comprising a plurality of sets, the plurality of sets comprising a plurality of ways, is provided. Responsive to a stack data request, the method stores a cache line associated with the stack data in one of a plurality of designated ways of the data cache, wherein the plurality of designated ways is configured to store all requested stack data.

Abstract translation: 提供了一种分割包括多个集合的数据高速缓存的方法，所述多个集合包括多个方式。 响应于堆栈数据请求，该方法将与堆栈数据相关联的高速缓存行存储在数据高速缓存的多个指定方式之一中，其中多个指定路径被配置为存储所有请求的堆栈数据。

公开(公告)号：US20140337587A1

公开(公告)日：2014-11-13

申请号：US14275271

申请日：2014-05-12

Applicant: Advanced Micro Devices, Inc.

Inventor： Derek R. HOWER ,  Mark D. Hill ,  David Wood ,  Steven K. Reinhardt ,  Benedict R. Gaster ,  Blake A. Hechtman ,  Bradford M. Beckmann

IPC: G06F12/02

CPC classification number: G06F9/44 ,  G06F8/436 ,  G06F8/454 ,  G06F9/52 ,  G06F9/522 ,  G06F9/524 ,  G06F9/526

Abstract: A method, computer program product, and system is described that determines the correctness of using memory operations in a computing device with heterogeneous computer components. Embodiments include an optimizer based on the characteristics of a Sequential Consistency for Heterogeneous-Race-Free (SC for HRF) model that analyzes a program and determines the correctness of the ordering of events in the program. HRF models include combinations of the properties: scope order, scope inclusion, and scope transitivity. The optimizer can determine when a program is heterogeneous-race-free in accordance with an SC for HRF memory consistency model . For example, the optimizer can analyze a portion of program code, respect the properties of the SC for HRF model, and determine whether a value produced by a store memory event will be a candidate for a value observed by a load memory event. In addition, the optimizer can determine whether reordering of events is possible.

Abstract translation: 描述了一种方法，计算机程序产品和系统，其确定在具有异构计算机组件的计算设备中使用存储器操作的正确性。 实施例包括基于用于异构无竞争（SC for HRF）的顺序一致性的特性的优化器，该模型分析程序并确定程序中的事件的顺序的正确性。 HRF模型包括属性的组合：范围顺序，范围包含和范围传递性。 优化器可以根据HR对HRF内存一致性模型的SC来确定程序何时是异构无竞争的。 例如，优化器可以分析程序代码的一部分，尊重SC的HRF模型的属性，并且确定由存储器存储器事件产生的值是否将是由加载存储器事件观察到的值的候选。 此外，优化器可以确定是否可能重新排序事件。

公开(公告)号：US09734059B2

公开(公告)日：2017-08-15

申请号：US13945659

申请日：2013-07-18

Applicant: ADVANCED MICRO DEVICES, INC.

Inventor： Lena E. Olson ,  Yasuko Eckert ,  Vilas K. Sridharan ,  James M. O'Connor ,  Mark D. Hill ,  Srilatha Manne

IPC: G06F12/08 ,  G06F12/0802 ,  G06F12/0875 ,  G06F12/123 ,  G06F12/0846 ,  G06F12/0864 ,  G06F12/0862

CPC classification number: G06F12/0802 ,  G06F12/0848 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/123 ,  G06F2212/1016 ,  G06F2212/1028 ,  G06F2212/451 ,  G06F2212/502 ,  G06F2212/601 ,  G06F2212/6032 ,  G06F2212/6082 ,  Y02D10/13

Abstract: A method of way prediction for a data cache having a plurality of ways is provided. Responsive to an instruction to access a stack data block, the method accesses identifying information associated with a plurality of most recently accessed ways of a data cache to determine whether the stack data block resides in one of the plurality of most recently accessed ways of the data cache, wherein the identifying information is accessed from a subset of an array of identifying information corresponding to the plurality of most recently accessed ways; and when the stack data block resides in one of the plurality of most recently accessed ways of the data cache, the method accesses the stack data block from the data cache.

公开(公告)号：US20140143499A1

公开(公告)日：2014-05-22

申请号：US13945659

申请日：2013-07-18

Applicant: ADVANCED MICRO DEVICES, INC.

Inventor： Lena E. Olson ,  Yasuko Eckert ,  Vilas K. Sridharan ,  James M. O'Connor ,  Mark D. Hill ,  Srilatha Manne

IPC: G06F12/12 ,  G06F12/08

CPC classification number: G06F12/0802 ,  G06F12/0848 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/0875 ,  G06F12/123 ,  G06F2212/1016 ,  G06F2212/1028 ,  G06F2212/451 ,  G06F2212/502 ,  G06F2212/601 ,  G06F2212/6032 ,  G06F2212/6082 ,  Y02D10/13

Abstract: A method of way prediction for a data cache having a plurality of ways is provided. Responsive to an instruction to access a stack data block, the method accesses identifying information associated with a plurality of most recently accessed ways of a data cache to determine whether the stack data block resides in one of the plurality of most recently accessed ways of the data cache, wherein the identifying information is accessed from a subset of an array of identifying information corresponding to the plurality of most recently accessed ways; and when the stack data block resides in one of the plurality of most recently accessed ways of the data cache, the method accesses the stack data block from the data cache.

Abstract translation: 提供了一种具有多种方式的数据高速缓存的方式预测方法。 响应于访问堆栈数据块的指令，该方法访问与数据高速缓存的多个最近访问的方式相关联的识别信息，以确定堆栈数据块是否位于数据的多个最近访问的方式之一 高速缓存，其中从与多个最近访问的方式对应的识别信息的数组的子集中访问所述识别信息; 并且当堆栈数据块驻留在数据高速缓存的多个最近被访问的方式之一时，该方法从数据高速缓存访​​问堆栈数据块。