Scheduling fixed-priority hard real-time tasks in the presence of faults

被引：0
|
作者：
Lima, G [1 ]
Burns, A
机构：
[1] Univ Fed Bahia, Distributed Syst Lab LaSiD, Dept Comp Sci, Salvador, BA, Brazil
[2] Univ York, Dept Comp Sci, Real Time Syst Res Grp, York YO10 5DD, N Yorkshire, England
来源：
DEPENDABLE COMPUTING, PROCEEDINGS | 2005年 / 3747卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We describe an approach to scheduling hard real-time tasks taking into account fault scenarios. All tasks are scheduled at run-time according to their fixed priorities, which are determined off-line. Upon error-detection, special tasks are released to perform error-recovery actions. We allow error-recovery actions to be executed at higher priority levels so that the fault resilience of the task set can be increased. To do so, we extend the well known response time analysis technique and describe a non-standard priority assignment policy. Results from simulation indicate that the fault resilience of the task sets can be significantly increased by using the proposed approach.
引用
收藏
页码：154 / 173
页数：20
相关论文
共 50 条
  • [31] Harmonic Semi-Partitioned Scheduling For Fixed-Priority Real-Time Tasks On Multi-Core Platform
    Fan, Ming
    Quan, Gang
    [J]. DESIGN, AUTOMATION & TEST IN EUROPE (DATE 2012), 2012, : 503 - 508
  • [32] Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds
    Rivera-Verduzco, Hector J.
    Bril, Reinder J.
    [J]. PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2017), 2017, : 307 - 317
  • [33] Semi-partitioned scheduling for fixed-priority real-time tasks based on intelligent rate monotonic algorithm
    Senobary, Saeed
    Naghibzadeh, Mahmoud
    [J]. INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2015, 6 (3-4) : 184 - 191
  • [34] The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling
    Zhao, Yecheng
    Zeng, Haibo
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2019, 68 (06) : 926 - 938
  • [35] Practical on-line DVS scheduling for fixed-priority real-time systems
    Mochocki, B
    Hu, XS
    Quan, G
    [J]. RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2005, : 224 - 233
  • [36] Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling
    Wang, Chao
    Dong, Chuansheng
    Zeng, Haibo
    Gu, Zonghua
    [J]. ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2016, 21 (03)
  • [37] Fixed-priority allocation and scheduling for energy-efficient fault tolerance in hard real-time multiprocessor systems
    Wei, Tongquan
    Mishra, Piyush
    Wu, Kaijie
    Liang, Han
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (11) : 1511 - 1526
  • [38] Exact Fault-Tolerant Feasibility Analysis of Fixed-Priority Real-Time Tasks
    Pathan, Risat Mahmud
    Jonsson, Jan
    [J]. 16TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2010), 2010, : 265 - 274
  • [39] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited
    Bril, Reinder J.
    Lukkien, Johan J.
    Verhaegh, Wim F. J.
    [J]. 19TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2007, : 269 - +
  • [40] Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds
    Rivera-Verduzco, Hector J.
    Bril, Reinder J.
    [J]. 2017 22ND IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2017,
12345