公开(公告)号：WO2018052551A1

公开(公告)日：2018-03-22

申请号：PCT/US2017/044601

申请日：2017-07-31

Applicant: QUALCOMM INCORPORATED

Inventor： ZHAO, Han ,  RAMAN, Arun ,  NATARAJAN, Aravind

IPC: G06F9/52 ,  G06F9/54 ,  H04N21/44

CPC classification number: G06F3/0613 ,  G06F3/0631 ,  G06F3/0656 ,  G06F3/0685 ,  G06F9/52 ,  G06F9/544 ,  G06F12/0811 ,  G06F12/084 ,  G06F12/0855 ,  G06F2212/283 ,  G06F2212/314

Abstract: Embodiments include computing devices, apparatus, and methods implemented by the apparatus for implementing data flow management on a computing device. Embodiment methods may include initializing a buffer partition of a first memory of a first heterogeneous processing device for an output of execution of a first iteration of a first operation by the first heterogeneous processing device on which a first iteration of a second operation assigned for execution by a second heterogeneous processing device depends. Embodiment methods may include identifying a memory management operation for transmitting the output by the first heterogeneous processing device from the buffer partition as an input to the second heterogeneous processing device. Embodiment methods may include allocating a second memory for storing data for an iteration executed by a third heterogeneous processing device to minimize a number of memory management operations for the second allocated memory.

Abstract translation: 实施例包括由用于在计算设备上实现数据流管理的装置实现的计算设备，装置和方法。 实施例方法可以包括初始化第一异构处理设备的第一存储器的缓冲器分区以执行由第一异构处理设备执行第一操作的第一次迭代的输出，第一异质处理设备在第一异质处理设备上执行第二次操作的第一次迭代， 第二异构处理设备依赖于。 实施例方法可以包括识别用于由第一异构处理设备从缓冲分区发送输出作为到第二异构处理设备的输入的存储器管理操作。 实施例方法可包括分配第二存储器以存储由第三异构处理设备执行的迭代的数据，以最小化第二分配存储器的存储器管理操作的数量。

公开(公告)号：WO2017127180A1

公开(公告)日：2017-07-27

申请号：PCT/US2016/066319

申请日：2016-12-13

Applicant: QUALCOMM INCORPORATED

Inventor： KUMAR, Tushar ,  NATARAJAN, Aravind ,  SUAREZ GRACIA, Dario

IPC: G06F9/46

CPC classification number: G06F3/0656 ,  G06F3/061 ,  G06F3/0673 ,  G06F9/3834 ,  G06F9/467 ,  G06F9/544 ,  G06F12/1072 ,  G06F2212/65

Abstract: Methods, devices, and non-transitory processor-readable storage media for a computing device to merge concurrent writes from a plurality of processing units to a buffer associated with an application. An embodiment method executed by a processor may include identifying a plurality of concurrent requests to access the buffer that are sparse, disjoint, and write-only, configuring a write-set for each of the plurality of processing units, executing the plurality of concurrent requests to access the buffer using the write-sets, determining whether each of the plurality of concurrent requests to access the buffer is complete, obtaining a buffer index and data via the write-set of each of the plurality of processing units, and writing to the buffer using the received buffer index and data via the write-set of each of the plurality of processing units in response to determining that each of the plurality of concurrent requests to access the buffer is complete.

Abstract translation: 用于计算设备的方法，设备和非暂时性处理器可读存储介质将来自多个处理单元的并发写入合并到与应用相关联的缓冲区。 由处理器执行的实施例方法可以包括：识别访问缓冲区的多个并发请求，所述并发请求是稀疏的，不相交的和只写的;为多个处理单元中的每一个配置写集;执行多个并发请求 使用所述写入集访问所述缓冲器，确定所述多个访问所述缓冲器的并发请求中的每一个是否完成，经由所述多个处理单元中的每一个的所述写入集获得缓冲器索引和数据，以及写入 响应于确定访问缓冲器的多个并发请求中的每一个都完成，使用所接收的缓冲器索引和数据经由多个处理单元中的每一个的写入集合来缓冲所述缓冲器。

公开(公告)号：WO2018038846A1

公开(公告)日：2018-03-01

申请号：PCT/US2017/043648

申请日：2017-07-25

Applicant: QUALCOMM INCORPORATED

Inventor： RAMAN, Arun ,  ZHAO, Han ,  NATARAJAN, Aravind

IPC: G06F9/50

CPC classification number: G06F9/5027 ,  G06F9/5066 ,  G06F2209/5017

Abstract: Embodiments include computing devices, apparatus, and methods implemented by the apparatus for implementing speculative loop iteration partitioning (SLIP) for heterogeneous processing devices. A computing device may receive iteration information for a first partition of iterations of a repetitive process and select a SLIP heuristic based on available SLIP information and iteration information for the first partition. The computing device may determine a split value for the first partition using the SLIP heuristic, and partition the first partition using the split value to produce a plurality of next partitions.

Abstract translation: 实施例包括由用于实现异构处理设备的推测性循环迭代分割（SLIP）的设备实现的计算设备，装置和方法。 计算设备可以接收重复过程的迭代的第一分区的迭代信息，并且基于第一分区的可用SLIP信息和迭代信息来选择SLIP启发式。 计算设备可以使用SLIP启发式确定第一分区的分割值，并且使用分割值对第一分区进行分割以产生多个下一分区。

公开(公告)号：WO2017172205A1

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

申请号：PCT/US2017/020164

申请日：2017-03-01

Applicant: QUALCOMM INCORPORATED

Inventor： SUAREZ GRACIA, Dario ,  CASCAVAL, Gheorghe ,  ZHAO, Han ,  KUMAR, Tushar ,  NATARAJAN, Aravind ,  RAMAN, Arun

IPC: G06F9/52

CPC classification number: G06F9/52 ,  G06F9/46

Abstract: Embodiments include computing devices, systems, and methods identifying enhanced synchronization operation outcomes. A computing device may receive a first resource access request for a first resource of a computing device including a first requester identifier from a first computing element of the computing device. The computing device may also receive a second resource access request for the first resource including a second requester identifier from a second computing element of the computing device. The computing device may grant the first computing element access to the first resource based on the first resource access request, and return a response to the second computing element including the first requester identifier as a winner computing element identifier.

Abstract translation: 实施例包括识别增强的同步操作结果的计算设备，系统和方法。 计算设备可以从计算设备的第一计算元件接收针对包括第一请求者标识符的计算设备的第一资源的第一资源访问请求。 计算设备还可以从计算设备的第二计算元件接收针对包括第二请求者标识符的第一资源的第二资源访问请求。 计算设备可以基于第一资源访问请求向第一计算元件授予对第一资源的访问权，并且向第二计算元件返回包括第一请求者标识符的响应作为获胜者计算元件标识符。

公开(公告)号：WO2016160169A1

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

申请号：PCT/US2016/018651

申请日：2016-02-19

Applicant: QUALCOMM INCORPORATED

Inventor： ROBATMILI, Behnam ,  AGA, Shaizeen, Dilawarhusen ,  SUAREZ GARCIA, Dario ,  RAMAN, Arun ,  NATARAJAN, Aravind ,  CASCAVAL, Gheorghe, Calin ,  MONTESINOS ORTEGO, Pablo ,  ZHAO, Han

IPC: G06F9/50

CPC classification number: G06F9/5066 ,  G06F9/5027

Abstract: Embodiments include computing devices, systems, and methods for task-based handling of repetitive processes in parallel. At least one processor of the computing device, or a specialized hardware controller, may be configured to partition iterations of a repetitive process and assign the partitions to initialized tasks to be executed in parallel by a plurality of processor cores. Upon completing a task, remaining divisible partitions of the repetitive process of ongoing tasks may be subpartitioned and assigned to the ongoing task, and the completed task or a newly initialized task. Information about the iteration space for a repetitive process may be stored in a descriptor table, and status information for all partitions of a repetitive process stored in a status table. Each processor core may have an associated local table that tracks iteration execution of each task, and is synchronized with the status table.

Abstract translation: 实施例包括用于并行地重复处理的基于任务的处理的计算设备，系统和方法。 计算设备的至少一个处理器或专用硬件控制器可以被配置为分区重复过程的迭代，并且将分区分配给由多个处理器核并行执行的初始化任务。 完成任务后，正在执行的任务的重复进程的剩余可分区可以被分分区并分配给正在进行的任务，以及完成的任务或新初始化的任务。 关于重复过程的迭代空间的信息可以存储在描述符表中，以及存储在状态表中的重复进程的所有分区的状态信息。 每个处理器核心可以具有跟踪每个任务的迭代执行的相关联的本地表，并且与状态表同步。

公开(公告)号：WO2017034738A1

公开(公告)日：2017-03-02

申请号：PCT/US2016/044168

申请日：2016-07-27

Applicant: QUALCOMM INCORPORATED

Inventor： SUAREZ GRACIA, Dario ,  KUMAR, Tushar ,  NATARAJAN, Aravind ,  HASTANTRAM, Ravish ,  CASCAVAL, Gheorghe Calin ,  ZHAO, Han

IPC: G06F9/50 ,  G06F9/48 ,  G06F11/34 ,  G06F12/0862 ,  G06F12/12 ,  G06F12/0806

CPC classification number: G06F9/48 ,  G06F9/4806 ,  G06F9/4831 ,  G06F9/4837 ,  G06F9/4843 ,  G06F9/4881 ,  G06F9/4893 ,  G06F9/50 ,  G06F9/5005 ,  G06F9/5011 ,  G06F9/5016 ,  G06F9/5022 ,  G06F9/5027 ,  G06F9/5033 ,  G06F9/5038 ,  G06F9/5044 ,  G06F9/505 ,  G06F9/5055 ,  G06F9/5083 ,  G06F9/5094 ,  G06F11/3419 ,  G06F11/3466 ,  G06F12/0806 ,  G06F12/0862 ,  G06F12/12 ,  G06F12/128 ,  G06F2212/1016 ,  G06F2212/62 ,  Y02D10/22 ,  Y02D10/24

Abstract: Various embodiments include methods for data management in a computing device utilizing a plurality of processing units. Embodiment methods may include generating a data transfer heuristic model based on measurements from a plurality of sample data transfers between a plurality of data storage units. The generated data transfer heuristic model may be used to calculate data transfer costs for each of a plurality of tasks. The calculated data transfer costs may be used to schedule execution of the plurality of tasks in an execution order on selected ones of the plurality of processing units. The data transfer heuristic model may be updated based on measurements of data transfers occurring during the executions of the plurality of tasks (e.g., time, power consumption, etc.). Code executing on the processing units may indicate to a runtime when certain data blocks are no longer needed and thus may be evicted and/or pre-fetched for others.

Abstract translation: 各种实施例包括利用多个处理单元的计算设备中的数据管理方法。 实施方式可以包括基于来自多个数据存储单元之间的多个采样数据传输的测量来生成数据传输启发式模型。 生成的数据传输启发式模型可用于计算多个任务中的每一个的数据传输成本。 所计算的数据传输成本可以用于以多个处理单元中的选定的处理单元的执行顺序调度多个任务的执行。 可以基于在执行多个任务期间发生的数据传输的测量（例如，时间，功耗等）来更新数据传输启发式模型。 在处理单元上执行的代码可以在不再需要某些数据块的情况下向运行时指示，并且因此可以被驱逐和/或预取其他数据块。

公开(公告)号：WO2016144449A1

公开(公告)日：2016-09-15

申请号：PCT/US2016/016515

申请日：2016-02-04

Applicant: QUALCOMM INCORPORATED

Inventor： NATARAJAN, Aravind ,  CASCAVAL, Gheorghe Calin

IPC: G06F9/50 ,  G06F12/02

CPC classification number: G06F12/0253 ,  G06F3/0608 ,  G06F3/065 ,  G06F3/068 ,  G06F9/5016 ,  G06F9/5022 ,  G06F2212/702

Abstract: Various embodiments include methods for reclaiming memory in a computing device that may include storing a first pointer pointing to a first memory location storing the beginning of a data structure in which a plurality of threads executing on the computing device may concurrently access the data structure and storing a second pointer pointing to the current beginning of the data structure. In response to performing an operation on the data structure that changes the location of the beginning of the data structure from the first memory location to a second memory location, the second pointer may be updated to point to the second memory location. In response to determining that memory allocated to the data structure may be reclaimed, memory allocated to the data structure, including memory located at the first memory location pointed to by the first pointer, may be reclaimed.

Abstract translation: 各种实施例包括用于在计算设备中回收存储器的方法，其可以包括存储指向存储数据结构的开始的第一存储器位置的第一指针，其中在计算设备上执行的多个线程可以同时访问数据结构并存储 指向数据结构的当前开始的第二个指针。 响应于对将数据结构的开始位置从第一存储器位置改变到第二存储器位置的数据结构进行操作，可以更新第二指针以指向第二存储器位置。 响应于确定分配给数据结构的存储器可以被回收，可以回收分配给数据结构的存储器，包括位于第一指针指向的第一存储器位置处的存储器。