• real-time
• multi-core
• scheduling

The class of the real-time multimedia streaming applications can be modeled, on multi-processor systems, as a pipeline of tasks. The pipeline is periodically activated and each instance has to be completed before a given
end-to-end deadline. A general problem is to allocate multiple real-time task pipelines on a multi-core systems, guaranteeing their schedulability and optimizing a user defined objective (i.e. minimum number of processors, minimum energy consumption, etc.).
The objective of this thesis is to analyze the problem from a mathematical point of view, and to design an algorithm to explore the space of possible solutions. The research activity rests on a previous investigation about the assignment scheduling parameters to the tasks. In this thesis, we propose a grouping strategies that try to minimize the number of processors required to schedule a pipeline, and hence the overall resource utilization. The proposed algorithm is evaluated on a wide combination of parameters and its effectiveness is compared against currently existing solutions.