Research Article
Dynamic Task Distribution Model for On-Chip Reconfigurable High Speed Computing System
Algorithm 2
Pseudo code for Task_Resource_Mapping function.
/ Input: Level annotated tasks of a DAG and number of tasks in the DAG | Output: ST and HT Partitioned tasks of DAG / | (1) Read the Level annotated tasks of DAG and number of tasks in DAG from algorithm | (2) Initialize HT Queue and ST Queue | (3) while (number of Level annotated tasks in DAG > 0) do | (4) for to number of Level annotated tasks in DAG do | (5) if area of task < size of available RLU then | (6) assign to HT Queue | (7) else | (8) assign to ST Queue | (9) end if | (10) end for | (11) end while | (12) Task_Distribution (partitioned tasks of DAG, number of tasks in the DAG) | / Function Task_Distribution is described in Algorithm 3 / |
|