On Resource Sharing under Multiprocessor Semi-Partitioned Scheduling

Sammanfattning: Semi-partitioned scheduling has been the subject of interest compared to conventional global and partitioned scheduling algorithms for multiprocessors due to better utilization results. In Semi-partitioned scheduling most of tasks are assigned to fixed processors while a few number of tasks are split up and allocated to different processors. Various techniques have been proposed recently on different assigning protocols under semi-partitioned scheduling. Yet an appropriate synchronization mechanism for resource sharing in semi-partitioned scheduling have not been investigated. In this thesis we propose two methods for handling resource sharing under semi-partitioned scheduling on multiprocessor platforms. The main challenge is handling the resource requests of tasks that are split over multiple processors. The solutions include handling non-split tasks as well as split tasks over requests for shared resources in the system. In this thesis we investigate delays caused by blocking on resources. Furthermore, we perform the schedulability analysis for both algorithms. Finally we evaluate the performance of our proposed synchronization algorithms by means of experimental evaluations.