A complete run-time overhead-aware schedulability analysis for MrsP under nested resources

Abstract

Multiprocessor Resource Sharing Protocol (MrsP) is a hard real-time multiprocessor resource sharing protocol for fully partitioned fixed-priority systems, and adopts a novel helping mechanism to allow task migrations during resource accessing. Previous research focusing on analysing MrsP systems have delivered two forms of timing analysis which effectively bound response time and migration cost of tasks under MrsP, and have demonstrated advantages of this protocol. An adjustable non-preemptive section is also introduced that effectively reduces the number of migrations needed during each resource access. However, these analysis methods are only applicable if a non-nested resource accessing model is assumed. In addition, there is no clear approach towards the configuration of the non-preemptive section length, and the computation cost for applying the analysis remains unknown. In this paper, we extend the MrsP analysis for systems with nested resources. Major run-time costs incurred by MrsP tasks are also taken into account to form a complete run-time cost-aware schedulability analysis. In addition, recommendations towards non-preemptive section configuration are given from both analytic and empiric perspectives. Finally, a set of evaluations are conducted to investigate schedulability of MrsP under nested resources and the cost for applying the proposed analysis. As a result of this paper, the schedulability test for MrsP is complete and the computation costs of its use are now understood.

Development Automation of Real-Time Java

“…There is a trend that most of the existing real-time programming speciications are extended to support multiprocessor and distributed systems [62]. The proposed approach can also be extended to support multiprocessor features with multiprocessor scheduling policies, resource sharing techniques and multiple server thread asynchronous event handling model taken into account [60,61]. In addition, as the application scenarios of real-time systems become more sophisticated, supporting complex system semantics (e.g., in the presence of release jitters, shared resources or nested AIEs) is also desirable and should be investigated.…”

Supporting Single and Multi-Core Resource Access Protocols on Object-Oriented RTOSes

“…Both MPCP and MSRP assume a restricted resource-accessing model, in which nested accesses to shared resources are not allowed [11]. Later on, protocols exclusively proposed for multiprocessor systems, such as the Multiprocessor resource sharing Protocol (MrsP) [12], assume a more flexible resource-accessing model with nested resources allowed and deadlocks avoided [12][13][14]. Moreover, there is still no consensus regarding the best approach for multiprocessor systems [14,15], mainly because the characteristics of an application, like the length of critical sections, affect the performance of such protocols [16].…”

“…Zhao and Wellings proposed a modified helping mechanism [47]. Zhao et al proposed an analysis of the migration costs and an improved schedulability test based on RTA in [16], while in [14] the same authors extended the MrsP schedulability test to support nested resource accesses and run-time costs (creating a complete run-time overhead-aware schedulability analysis for MrsP).…”

“…RNLP limits concurrency by a k-exclusion and access granting mechanisms. However, the algorithm provides sub-optimal results under different system configurations, limiting its applicability in real-world scenarios [14].…”