Temporal Partitioning of Tasks on a Heterogeneous Reconfigurable Architecture

Partitioning of tasks on a heterogeneous reconfigurable architecture (RA) is a constrained placement problem. FPGAs being reconfigurable devices can implement spatial tasks that fit in the device´s finite state and operational resources. The partitioning problems for heterogeneous system need to be scheduled at early stages of the design process. We present a technique to partition a task into temporally interconnected sub-tasks. These temporal partitioned tasks are then implemented on the target RA to yield efficient and cost effective results for partitioning applications.