Invention Grant
US09201659B2 Efficient directed acyclic graph pattern matching to enable code partitioning and execution on heterogeneous processor cores 有权
高效的有向无环图模式匹配,以实现异构处理器内核上的代码分割和执行

Efficient directed acyclic graph pattern matching to enable code partitioning and execution on heterogeneous processor cores
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.
Information query
Patent Agency Ranking
0/0