$$ Make your low$-$power $($low$-$energy$)$ scheduling

algorithm and describe it just briefly. $$ Brief algorithm description is enough.

$$ Make an example of data$-$flow graph by yourself, apply your low$-$power $($low$-$energy$)$ scheduling algorithm to it$,$ and show that your algorithm reduces power $($or energy$).$

$$ Please assume reasonable power or energy consumption for each functional unit.

$$ For example, a fast adder $($which requires one control step to execute$)$ has the power consumption of $10,$ while a slow adder $($which requires two control steps to execute$)$ has the power consumption of $5.$

$$ Describe your comments on your scheduling algorithm.