In general, configurable computers provide the ability to reconfigure rapidly to any desired custom form. Hence, the available resources can be reused effectively to cut down the hardware costs and also improve the performance. In this paper, we introduce the concept of temporal partitioning to partition a task into temporally interconnected subtasks. Specifically, we present algorithms for temporal partitioning and scheduling data flow graphs for configurable computers. However, a temporal partitioning of the data flow graph followed by proper scheduling can facilitate the configurable computer based execution.
Scheduling assigns an execution order to the partitioned segments so as to ensure proper execution.
All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .