ACM Home Page
Please provide us with feedback. Feedback
Pareto-optimization-based run-time task scheduling for embedded systems
Full text PdfPdf (213 KB)
Source International Symposium on Systems Synthesis archive
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis table of contents
Newport Beach, CA, USA
SESSION: Advances in embedded software scheduling techniques table of contents
Pages: 120 - 125  
Year of Publication: 2003
ISBN:1-58113-742-7
Authors
Peng Yang  IMEC, Leuven, Belgium
Francky Catthoor  IMEC, Leuven, Belgium
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 63,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/944645.944680
What is a DOI?

ABSTRACT

Pareto-set-based optimization can be found in several different areas of embedded system design. One example is task scheduling, where different task mapping and ordering choices for a target platform will lead to different performance/cost tradeoffs. To explore this design space at run-time, a fast and effective heuristic is needed. We have modeled the problem as the well known Multiple Choice Knapsack Problem(MCKP) and have developed a fast greedy heuristic for the run-time task scheduling. To show the effectiveness of our algorithm, examples from randomly generated task graphs and realistic applications are studied. Compared to the optimal dynamic programming solver, the heuristic is more than ten times faster while the result is less than 5\% away from the optimum. Moreover, due to its iterative feature, the algorithm is well suitable to be used as an on-line algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
 
5
 
6
 
7
I. Hong et al. Power Optimization of Variable Voltage Core-Based Systems. IEEE Trans. Computer Aided Design, 18(12):1702--14, Dec. 1999.
 
8
9
10
11
 
12
 
13
 
14
D. Pisinger. Algorithms for Knapsack Problems. PhD thesis, Dept. of Computer Science, University of Copenhagen, Denmark, 1995.
15
16
 
17
K. Ramamritham and J. A. Stankovic. Scheduling Algorithms and Operation Systems Support for Real-Time Systems. Proc. IEEE, 82(1):55--67, Jan. 1994.
18
19
 
20
21

CITED BY  10

Collaborative Colleagues:
Peng Yang: colleagues
Francky Catthoor: colleagues