Hierarchical

task scheduler for interleaving subtasks on heterogeneous multiprocessor platforms Abstract — Nowadays, the System-on-a-chip (SoC) has integrated more processors onto a single chip. Applications are also consisting of multiple tasks that are presented as different source code which can be partly executed concurrently. To efficiently use the multiprocessor platforms, system designers have to divide application tasks into sets of subtasks and map subtasks onto the parallel processors. However, the subtasklevel parallelism inside a single task is often too limited to fully utilize all the parallel processors and results in many slacks on processors. To better use the processors, subtasks of multiple tasks will have to be executed in an interleaving fashion. This paper proposes design-time algorithms to interleave subtasks based on the separated schedules of tasks. This can be considered as a hierarchical scheduler to steer the code generation of very complex applications with many tasks. The scheduling experiments show that the execution time can be shortened by 20%–30%by interleaving two tasks and the differences between the solutions given by our scheduling algorithm and the optimal solutions are less than 6 % for up to 20 subtasks. I