|Dynamic task scheduling and processing element allocation for multi-function SoCs
|Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
This work is motivated by the rapid increasing of the design complexity of many embedded systems. It aims at the proposing of solutions to resolve the hardware contention issues of non-preemptive processing elements shared among tasks and the cost optimization. A software solution based on the starting time management is proposed to interleave task executions on processing elements. Algorithms are proposed to determine the required processing elements of selected types, when there is no knowledge on the releasing time of any task: When task release orders are known a priori, an optimal algorithm is presented if processing elements have the same cost; otherwise, a pseudo-polynomial-time algorithm based on dynamic programming is presented for optimal solutions. The performance of the algorithms is also evaluated for general cases. © 2007 IEEE.
|Computational complexity; Dynamic programming; Embedded systems; Knowledge engineering; Polynomial approximation; Scheduling algorithms; Design complexity; Dynamic task scheduling; Optimal solutions; Processing elements; Microprocessor chips
|Appears in Collections:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.