Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Guan, Nan; Han, Mei; Gu, Chuancai; Deng, Qingxu; Yi, Wang

doi:10.1109/rtcsa.2015.9

Cited by 11 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some exact schedulability tests for global static-priority [63], [65] and global EDF [12], [19], [39] scheduling are known, but their scalability is such that they cannot be applied to anything more than toy examples (from an industrial perspective). When sufficient schedulability tests are used, the current state-of-the-art analyses for global scheduling, both for static-priority [31], [40], [41], [63] and EDF [11], [13], [64], stem from the seminal work by Baker [10], which leads to an interference upper bound with a multiplicative factor of 1/m in the resulting tests, where m is the number of processors. These analyses are, however, not able to show any gain compared to partitioned scheduling, even if task migration costs are ignored.…”

Section: Generalization In Implementation Spacementioning

confidence: 99%

On the Trade-offs between Generalization and Specialization in Real-Time Systems

Brüggen

Burns

Chen

et al. 2022

2022 IEEE 28th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

While academia favours general research that is applicable to a large class of systems, this paper highlights the necessity of research into specific scenarios and aims to increase its acceptance in the real-time systems community. We argue that such research is not only motivated by greater applicability to industry, but that specialization can also provide valuable information from a purely academic perspective. In addition, the trade-offs between generalization and specialization are examined, considering not only theoretical performance, but also the impact on essential non-functional properties that are important for industry, namely composability, robustness, extensibility, and parametric simplicity.• Special Cases: When are special cases useful? Why is the exploration of special cases important and valuable?• General Cases: When are general cases useful? What should be considered when evaluating the quality of solutions and analyses for general cases? We motivate, and provide evidence for, a series of observations that distil the key differences between a focus on special rather than 1 This work covers a broad spectrum of topics related to real-time systems. We assume that the reader is familiar with basic concepts from the realtime systems literature, and therefore, to increase the reading flow, we do not introduce them in detail. Less common concepts and terminology related to a specific sub-problem are introduced in the appropriate section of the paper. A glossary of common real-time systems terminology can be found at https://site.ieee.org/tcrts/education/terminology-and-notation/.

show abstract

Section: Generalization In Implementation Spacementioning

confidence: 99%

On the Trade-offs between Generalization and Specialization in Real-Time Systems

Brüggen

Burns

Chen

et al. 2022

2022 IEEE 28th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

View full text Add to dashboard Cite

show abstract

“…Another G-FP test has been proposed in Liu and Anderson (2013), but its authors reported that there was an error in the workload formulation, and its performance was never re-validated. The G-FP test in Guan et al (2015) tries to estimate the CI task's interference more carefully; however, the improvement it brings may not be justified by its additional runtime complexity.…”

Section: Related Workmentioning

confidence: 99%

Assessing the pessimism of current multicore global fixed-priority schedulability analysis

Sun

Natale

2018

Proceedings of the 33rd Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

This work provides a formal assessment on the pessimism of existing methods for the schedulability analysis of multicores with global fixed priority (FP) scheduling. We show how according to the existing analysis methods for FP scheduling, it is relatively easy to define a simple task allocation strategy followed by local analysis that dominates the existing global-FP feasibility analysis algorithms, in terms of deadline guarantees. Rather than being an indication of a true comparison between the effectiveness of local and global policies, we consider the result as an indication of the limited maturity of multicore global analysis (and its outstanding pessimism). Additionally, we show how a simple change in the task model, consisting in splitting the task execution and performing the analysis in two stages, allows to provide a better global schedulability analysis that overcomes this limitation. However, the new analysis mainly aims to show where the demonstrated pessimism most likely comes from. Due to the huge pessimism pointed out on existing analyses and the limited improvement from the new analysis, more efforts from the community are needed to enhance the multicore global scheduling works.

show abstract

Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling

Xie,

Xiong,

et al. 2023

2023 60th ACM/IEEE Design Automation Conference (DAC)

View full text Add to dashboard Cite

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Cited by 11 publications

References 22 publications

On the Trade-offs between Generalization and Specialization in Real-Time Systems

On the Trade-offs between Generalization and Specialization in Real-Time Systems

Assessing the pessimism of current multicore global fixed-priority schedulability analysis

Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling

Contact Info

Product

Resources

About