Dynamic scheduling of concurrent tasks with cost performance trade-off

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 intends to combine the advantages of the low run time complexity of the static scheduler and the flexibility of the dynamic scheduler and to optimize the system energy consumption at run time based on precomputed cost-performance Pareto curves. We have applied our method to an ADSL modem application and the result shows the effectiveness of our method.

Cite

CITATION STYLE

APA

Yang, P., Desmet, D., Catthoor, F., & Verkest, D. (2000). Dynamic scheduling of concurrent tasks with cost performance trade-off. In Proceedings of the International Conference on Compilers, Architecture and Synthesis for Embedded Systems (pp. 103–109). Association for Computing Machinery (ACM). https://doi.org/10.1145/354880.354895

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free