Resource Sharing under Multiprocessor Semi-partitioned Scheduling

Abstract

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 semipartitioned 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.

Resource-Oriented Partitioning for Multiprocessor Systems with Shared Resources

“…Recent analysis and comparisons of real-time locking protocols can be found in [13], [44] for partitioned scheduling and in [46] for global scheduling. In addition, several protocols for hybrid scheduling approaches, such as clustered [15] and semi-partitioned [1] scheduling, reservation-based scheduling [24], and open real-time systems [36], have been proposed in recent years. To support nested critical sections, Ward and Anderson [41], [42] have introduced the Real-time Nested Locking Protocol (RNLP), which employs a token lock and a request satisfaction mechanism to support fine-grained nested locking.…”

Resource sharing under server-based multiprocessor scheduling

“…The scheduling policy includes two levels: (i) a fixed priority uniprocessor scheduling that schedules nonmigrating tasks along with the server on each core and (ii) migrating tasks scheduling decision which determines in which server the non-migrating task execute. Next we develop our protocol rules based on the SDS structure [4] and inspiration from the synchronization protocol for semi-partitioned system [5].…”