Any complex application can be realized as a graph of dependent tasks, and scheduling these tasks onto a limited number of computational resources while satisfying their dependencies is a well-known NP-complete optimization problem. For microprocessor systems, several algorithms have been proposed that can efficiently find suboptimal schedules. A solution… (More)