Invention Grant
US09201659B2 Efficient directed acyclic graph pattern matching to enable code partitioning and execution on heterogeneous processor cores
有权
高效的有向无环图模式匹配,以实现异构处理器内核上的代码分割和执行
- Patent Title: Efficient directed acyclic graph pattern matching to enable code partitioning and execution on heterogeneous processor cores
- Patent Title (中): 高效的有向无环图模式匹配,以实现异构处理器内核上的代码分割和执行
-
Application No.: US13969735Application Date: 2013-08-19
-
Publication No.: US09201659B2Publication Date: 2015-12-01
- Inventor: Dinakar Dhurjati , Minjang Kim , Christopher A. Vick
- Applicant: QUALCOMM Incorporated
- Applicant Address: US CA San Diego
- Assignee: QUALCOMM Incorporated
- Current Assignee: QUALCOMM Incorporated
- Current Assignee Address: US CA San Diego
- Agency: The Marbury Law Group, PLLC
- Main IPC: G06F9/45
- IPC: G06F9/45 ; G06F9/44 ; G06F9/38

Abstract:
Methods, devices, and systems for automatically determining how an application program may be partitioned and offloaded for execution by a general purpose applications processor and an auxiliary processor (e.g., a DSP, GPU, etc.) within a mobile device. The mobile device may determine the portions of the application code that are best suited for execution on the auxiliary processor based on pattern-matching of directed acyclic graphs (DAGS). In particular, the mobile device may identify one or more patterns in the code, particularly in a data flow graph of the code, comparing each identified code pattern to predefined graph patterns known to have a certain benefit when executed on the auxiliary processor (e.g., a DSP). The mobile device may determine the costs and/or benefits of executing the portions of code on the auxiliary processor, and may offload portions that have low costs and/or high benefits related to the auxiliary processor.
Public/Granted literature
Information query