公开(公告)号：US10198349B2

公开(公告)日：2019-02-05

申请号：US15269495

申请日：2016-09-19

Applicant: Advanced Micro Devices, Inc.

Inventor： Mauricio Breternitz ,  Walter B. Benton

IPC: G06F12/00 ,  G06F17/00 ,  G06F9/30 ,  G06F13/00 ,  G06F13/28

Abstract: Systems, apparatuses, and methods for utilizing in-memory accelerators to perform data conversion operations are disclosed. A system includes one or more main processors coupled to one or more memory modules. Each memory module includes one or more memory devices coupled to a processing in memory (PIM) device. The main processors are configured to generate an executable for a PIM device to accelerate data conversion tasks of data stored in the local memory devices. In one embodiment, the system detects a read request for data stored in a given memory module. In order to process the read request, the system determines that a conversion from a first format to a second format is required. In response to detecting the read request, the given memory module's PIM device performs the conversion of the data from the first format to the second format and then provides the data to a consumer application.

公开(公告)号：US20170161114A1

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

申请号：US14962784

申请日：2015-12-08

Applicant: Advanced Micro Devices, Inc.

Inventor： Walter B. Benton ,  Steven K. Reinhardt

IPC: G06F9/50

CPC classification number: G06F9/4881 ,  G06F2209/483

Abstract: A computing device is disclosed. The computing device includes an Accelerated Processing Unit (APU) including at least a first Heterogeneous System Architecture (HSA) computing device and at least a second HSA computing device, the second computing device being a different type than the first computing device, and an HSA Memory Management Unit (HMMU) allowing the APU to communicate with at least one memory. The computing task is enqueued on an HSA-managed queue that is set to run on the at least first HSA computing device or the at least second HSA computing device. The computing task is re-enqueued on the HSA-managed queue based on a repetition flag that triggers the number of times the computing task is re-enqueued. The repetition field is decremented each time the computing task is re-enqueued. The repetition field may include a special value (e.g., −1) to allow re-enqueuing of the computing task indefinitely.