Embedded systems running under dynamic conditions often encounter the arrivals of new TF at run-time. Conventional run-time scheduling approaches are mostly focused on the topic of how to schedule both existing TF and new TF together such that all (hard and/or soft) real-time constraints are met. However, today’s portable embedded systems do not only require a schedule that can fulfill the timing constraints, they also need a run-time scheduler that produces energy-efficient schedules and causes very little overheads in order to meet the constraints of energy dissipation. Chapter 6 has considered the needs of energy-efficient run-time scheduling and presented the basic run-time scheduling technique.


Local Search Greedy Search Global Schedule Neighborhood Space Multiprocessor Platform 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Personalised recommendations