PROJECT TITLE :

Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources

ABSTRACT:

The periodic task set assignment problem within the context of multiple processors has been studied for many years. Totally different heuristic approaches have been proposed, such as the most effective-Match (BF), the primary-Match (FF), and also the Worst-Fit (WF) task assignment algorithms. However, when processors aren't dedicated but only periodically available to the task set, whether existing approaches still offer good performance or if there's a higher task assignment approach in the new context are research problems which, to our greatest knowledge, haven't been studied by the important-time research community. During this paper, we have a tendency to present the most effective-Harmonically-Match (BHF) task assignment algorithm to assign periodic tasks on multiple periodic resources. By periodic resource we mean that for each mounted time interval, i.e., the period, the resource perpetually provides the identical quantity of processing capability to a given task set. Our formal analysis indicates that if a harmonic task set is additionally harmonic with a resource's period, the resource capability will be absolutely utilised by the task set. Based mostly on this analysis, we present the most effective-Harmonically-Match task assignment algorithm. The experimental results show that, on average, the BHF algorithm results in , , and % higher resource utilization rate than the most effective-Work Decreasing (BFD), the first-Match Decreasing (FFD), and also the Worst-Work Decreasing (WFD) task assignment algorithms, respectively; however comparing to the optimal r- source utilization rate found by exhaustive search, it is about percent lower.