Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems

Abstract

The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints. While multiple protocols have been developed in the past decades, their performance highly depends on the task partition and prioritization. The recently proposed Dependency Graph Approach showed its advantages and attracted a lot of interest. It is, however, restricted to task sets where each task has at most one critical section. In this paper, we remove this restriction and demonstrate how to utilize algorithms for the classical job shop scheduling problem to construct a dependency graph for tasks with multiple critical sections. To show the applicability, we discuss the implementation in LITMUS RT and report the overheads. Moreover, we provide extensive numerical evaluations under different configurations, which in many situations show significant improvement compared to the state-of-the-art.

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

“…Chen et al [111], has removed a significant constraint associated with newly established dependency graph approaches, namely just one crucial section per task (DGA). Under terms of computational complexity, shown that even in extremely limited settings, the multiprocessor synchronization issue is NP-complete.…”

Boosted System Performance based on Execution Time Using LiMca Scheduling Algorithm

“…Time constraint is one of the major observation in different types of scheduling tasks. Minimal computation task time is preferable for better performance in a system to speed up the operation [5]. Multiprocessor based system is authoritative to handle the intricate applications like avionics while considering the less execution time and low power consumption.…”