Performance comparison of partitioned and global approaches for weakly hard real-time systems

Abstract One way to minimizing resource requirements is through the careful management and allocation, in example, scheduling. Research on weakly hard real-time scheduling on multiprocessor has been extremely limited; most prior research on real-time scheduling on weakly hard real-time has been confined to uniprocessors. The need for multiprocessor is due to issues that impose limits on the performance of a single processor. As real-time application systems increasingly come to be implemented upon multiprocessor environments, thus, this study applies multiprocessor scheduling approach for verification of weakly hard real-time tasks and to guaranteeing the timing requirements of the tasks. In fact, within the multiprocessor, the task allocation and migration problems seem even harder than in uniprocessor case; thus, in order to cater that problem, the sufficient and efficient scheduling algorithm supported by accurate schedulability analysis technique is present to provide weakly hard real-time guarantees. The proposed approach involves the two existing multiprocessor real-time scheduling algorithms combining with the hyperperiod analysis and deadline models; weakly hard constraints and μ-pattern. In this paper, the Matlab simulation tool is used in order to validate the result of analysis. From the experimental and performance evaluation results, it proved that the proposed approach is satisfied the tasks deadlines with less number of misses.