Fault tolerant global scheduling with non-preemptive backups

被引：0

作者：

Peng H. ^{[1
]}

Lu Y. ^{[1
]}

Sun F. ^{[1
]}

Han J.-H. ^{[1
]}

机构：

[1] School of Computer and Information, Hefei University of Technology, Hefei

来源：

Han, Jiang-Hong (hanjh@hfut.edu.cn) | 1600年 / Chinese Academy of Sciences卷 / 27期

基金：

中国国家自然科学基金;

关键词：

Fault-tolerant scheduling; Global scheduling; Hard real-time system; Multiprocessor; Primary-backup;

D O I：

10.13328/j.cnki.jos.004917

中图分类号：

学科分类号：

摘要：

Fault tolerance is a critical capability of hard real-time systems. Even with faults, fault tolerant scheduling algorithms are able to guarantee the real time property of tasks. In primary-backup based fault tolerant scheduling algorithms, only a small time window is left for the backup when the primary faults occur, therefore the backup will likely miss its deadline. This paper proposes a fault tolerant global scheduling with non-preemptive backups (FTGS-NPB). By assigning the highest priority to all backups, the backup can attain processor immediately in case of primary faults, and keep executing until finishing its job. In this way the backup can achieve the shortest response time. The schedulability tests are set up based on deadline analysis and response time analysis. The compatibility of priority assignment algorithms and schedulability tests is discussed. The simulation results show that FTGS-NPB can reduce the amount of additional processors for achieving fault tolerant capability. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

引用

页码：3158 / 3171

页数：13

共 23 条

[21] Andersson B., Global static-priority preemptive multiprocessor scheduling with utilization bound 38%, Proc. of the 12th Int'l Conf. on Principles of Distributed Systems, pp. 73-88, (2008)
[22] Andersson B., Jonsson J., Fixed-Priority preemptive multiprocessor scheduling: To partition or not to partition, Proc. of the 7th Int'l Conf. on Real-Time Computing Systems and Applications, pp. 337-346, (2000)
[23] Audsley N.C., On priority assignment in fixed priority scheduling, Information Processing Letters, 79, 1, pp. 39-44, (2001)

← 1 2 3 →