Performance evaluation of real time schedulers for a multicomputer

Abstract

This paper threats about a work that is inserted in the context of CRUX project, which aims the conception of a complete environment for parallel programming, in development in the Course of Pos-graduation in Computer Science of Santa Catarina Federal University. This paper makes an evaluation of performance of several scheduling algorithms of real time found in the bibliography, about a simulation model that represents as the processing as the communication of this multicomputer. The objective was to quantify the effect of the scheduling algorithm and other factors about some metrics of selected performance, in order to verify the applicability of CRUX in real time systems.

Dynamic task partition for video decoding on heterogeneous dual-core platforms

“…On the other hand, a task-scheduling policy determines the exact execution time of a task assigned to a specific core. For SMP platforms where all processing cores have the same architecture and shares a common memory space, the solution to the dynamic task partition problem is quite straightforward and efficient [Janssens et al 1986;Manimaran and Murthy 1998;Cancian and Friedrich 2002;Wendorf et al 1989], but it is non-trivial for heterogeneous multi-core platforms [Baruah 2004, Hoelzenspies et al 2008]. Although there are many studies on task scheduling for asymmetric multiprocessor (AMP) systems, the focus of these studies are on dynamic task scheduling for processors with homogeneous architecture in a master/slave cooperation configuration [Wendorf et al 1989;Greenberg and Wright 1991;Avritzer et al 1990;Momtchev and Marquet 2002].…”