The Multiprocessor Priority Ceiling Protocol （MPCP） is a classic suspension-based real-time locking protocol for partitioned fixed-priority （P-FP） scheduling. However, existing blocking time analysis is pessimisti...The Multiprocessor Priority Ceiling Protocol （MPCP） is a classic suspension-based real-time locking protocol for partitioned fixed-priority （P-FP） scheduling. However, existing blocking time analysis is pessimistic under the P-FP ＋ MPCP scheduling, which negatively impacts the schedulability for real-time tasks. In this paper, we model each task as an alternating sequence of normal and critical sections, and use both the best-case execution time （BCET） and the worst-case execution time （WCET） to describe the execution requirement for each section. Based on this model, a novel analysis is proposed to bound shared resource requests. This analysis uses BCET to derive the lower bound on the inter-arrival time for shared resource requests, and uses WCET to obtain the upper bound on the execution time of a task on critical sections during an arbitrary time interval of △t. Based on this analysis, improved blocking analysis and its associated worst-case response time （WCRT） analysis are proposed for P-FP ＋ MPCP scheduling. Schedulability experiments indicate that the proposed method outperforms the existing methods and improves the schedulability significantly.展开更多
航空电子全双工交换式以太网(AFDX,Avionics Full Duplex SwitchedEthernet)是新一代大型飞机机载网络的首选方案,构建其上的航空电子系统应保证强实时应用在时限内完成.针对现有AFDX实时性研究仅给出网络延迟上界的不足,综合考虑了任...航空电子全双工交换式以太网(AFDX,Avionics Full Duplex SwitchedEthernet)是新一代大型飞机机载网络的首选方案,构建其上的航空电子系统应保证强实时应用在时限内完成.针对现有AFDX实时性研究仅给出网络延迟上界的不足,综合考虑了任务的响应时间以及实时消息在AFDX网络中的传输延迟.建立了使用AFDX网络的航空电子系统模型,分析了分布式任务序列的整体时间需求.应用全局分析思想,给出任务序列的最坏情况响应时间,为系统实时性的评价和优化提供了理论依据.仿真结果表明该分析给出了紧凑的任务序列响应时间上界.展开更多
In hard real-time systems, schedulability analysis is not only one of the important means of guaranteeing the timelines of embedded software but also one of the fundamental theories of applying other new techniques, s...In hard real-time systems, schedulability analysis is not only one of the important means of guaranteeing the timelines of embedded software but also one of the fundamental theories of applying other new techniques, such as energy savings and fault tolerance. However, most of the existing schedulability analysis methods assume that schedulers use preemptive scheduling or non-preemptive scheduling. In this paper, we present a schedulability analysis method, i.e., the worst-case hybrid scheduling (WCHS) algorithm, which considers the influence of release jitters of transactions and extends schedulability analysis theory to timing analysis of linear transactions under fixed priority hybrid scheduling. To the best of our knowledge, this method is the first one on timing analysis of linear transactions under hybrid scheduling. An example is employed to demonstrate the use of this method. Experiments show that this method has lower computational complexity while keeping correctness, and that hybrid scheduling has little influence on the average worst-case response time (WCRT), but a negative impact on the schedulability of systems.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.61103041the National High Technology Research and Development 863 Program of China under Grant No.2012AA010904+2 种基金the Fundamental Research Funds for the Central Universities of China under Grant No.ZYGX2012J070the Huawei Technology Foundation under Grant No.IRP-2012-02-07the Excellent Ph.D.Student Academic Support Program of UESTC under Grant No.YBXSZC20131028
文摘The Multiprocessor Priority Ceiling Protocol （MPCP） is a classic suspension-based real-time locking protocol for partitioned fixed-priority （P-FP） scheduling. However, existing blocking time analysis is pessimistic under the P-FP ＋ MPCP scheduling, which negatively impacts the schedulability for real-time tasks. In this paper, we model each task as an alternating sequence of normal and critical sections, and use both the best-case execution time （BCET） and the worst-case execution time （WCET） to describe the execution requirement for each section. Based on this model, a novel analysis is proposed to bound shared resource requests. This analysis uses BCET to derive the lower bound on the inter-arrival time for shared resource requests, and uses WCET to obtain the upper bound on the execution time of a task on critical sections during an arbitrary time interval of △t. Based on this analysis, improved blocking analysis and its associated worst-case response time （WCRT） analysis are proposed for P-FP ＋ MPCP scheduling. Schedulability experiments indicate that the proposed method outperforms the existing methods and improves the schedulability significantly.
文摘航空电子全双工交换式以太网(AFDX,Avionics Full Duplex SwitchedEthernet)是新一代大型飞机机载网络的首选方案,构建其上的航空电子系统应保证强实时应用在时限内完成.针对现有AFDX实时性研究仅给出网络延迟上界的不足,综合考虑了任务的响应时间以及实时消息在AFDX网络中的传输延迟.建立了使用AFDX网络的航空电子系统模型,分析了分布式任务序列的整体时间需求.应用全局分析思想,给出任务序列的最坏情况响应时间,为系统实时性的评价和优化提供了理论依据.仿真结果表明该分析给出了紧凑的任务序列响应时间上界.
基金the National Natural Science Foundation of China (No. 60533040)the Hi-Tech Research and Development Program (863) of China (Nos. 2007AA010304 and 2007AA01Z129)the Key Scientific and Technological Project of Hangzhou Tech-nology Bureau, China (No. 20062412B01)
文摘In hard real-time systems, schedulability analysis is not only one of the important means of guaranteeing the timelines of embedded software but also one of the fundamental theories of applying other new techniques, such as energy savings and fault tolerance. However, most of the existing schedulability analysis methods assume that schedulers use preemptive scheduling or non-preemptive scheduling. In this paper, we present a schedulability analysis method, i.e., the worst-case hybrid scheduling (WCHS) algorithm, which considers the influence of release jitters of transactions and extends schedulability analysis theory to timing analysis of linear transactions under fixed priority hybrid scheduling. To the best of our knowledge, this method is the first one on timing analysis of linear transactions under hybrid scheduling. An example is employed to demonstrate the use of this method. Experiments show that this method has lower computational complexity while keeping correctness, and that hybrid scheduling has little influence on the average worst-case response time (WCRT), but a negative impact on the schedulability of systems.
