Research Article
Power and Execution Time Optimization through Hardware Software Partitioning Algorithm for Core Based Embedded System
Algorithm 1
Generation of partitions.
| // generate the mix partitions | | For all | | If (pred () = 0) then // is the start node of the control-construct partition | | ≤ | | If () | | | | ; | | End if | | else | | If ( ) | | ; | | If | | | | | | End if | | End if | | End if | | If (succ() = 0) then // is the end node of the control-construct partition | | | | If () | | | | ; | | End if | | else | | If ( ) | | ; | | If () | | | | | | End if | | End if | | End if | | End for; | | // find the combination of the previous generated partitions | | | | For all | | | | For all | | if then | | ; | | | | | | | | else | | | | end if | | end for | | if then | | while () do | | make all possible combinations | | | | | | end | | end if | | End begin |
|