Dynamic scheduling of concurrent tasks with cost performance trade-off
Peng Hao Yang, Dirk Desmet, Francky Catthoor, Diederik Verkest · 2000
This paper addresses the run time task scheduling problem on a multiprocessor platform for embedded systems, where energy consumption is a major concern, as opposed to the traditional static and dynamic scheduling approaches.Our approach i n tends to combine the advantages of the low run time complexity o f the static scheduler and the exibility of the dynamic scheduler and to optimize the system energy consumption at run time based on precomputed costperformance Pareto curves.We have applied our method to an ADSL modem application and the result shows the eectiveness of our method.Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific