A heterogenous multiprocessor system is usually composed of one general purpose processor and one or more specific purpose computing component. While heterogenous multiprocessor system becomes more popular, more and more researches pay lots of attention to this domain. In such a system, tasks often need to be processed at multiple different functional processing units. Therefore a task is usually divided into several subtasks according to its execution requirement, each of which is executed at particular processing unit with precedence constraints. In this paper, we present an EDF-based algorithm to schedule the tasks in the heterogenous multiprocessor system and propose the scheduability analysis. A series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Kuo, C. F., & Hai, Y. C. (2010). Real-time task scheduling on heterogeneous two-processor systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6082 LNCS, pp. 68–78). https://doi.org/10.1007/978-3-642-13136-3_7
Mendeley helps you to discover research relevant for your work.