<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06091630</id>
  <dt>j</dt>
  <an>06091630</an>
  <augroup>
    <au>Hao, Shuixia</au>
    <au>Zeng, Guosun</au>
    <au>Tan, Yiming</au>
  </augroup>
  <ti>The methods of heterogeneous and reconfigurable task partitioning based on DAG.</ti>
  <so>J. Tongji Univ., Nat. Sci. 39, No. 11, 1693-1698 (2011).</so>
  <py>2011</py>
  <pu>Editorial Department of Journal of Tongji University, Shanghai</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>directed acyclic graph</ut>
    <ut>heterogeneous computing task</ut>
    <ut>reconfigurable architecture</ut>
    <ut>task partitioning</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.3969/j.issn.0253.374x.2011.11.023</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In order to realize high-performance and low-power computing with task partitioning as the study object, the heterogeneous reconfigurable computing definition and its formal description are proposed. Two task partitioning methods, intra-node recombined and network rebuild, are presented based on matching heterogeneous computing task with reconfigurable architecture. Then an algorithm is derived. Theoretical analysis and simulations prove the task-partitioning algorithm to be valid.</ab>
    <rv></rv>
  </abgroup>
</item>