Abstract
In the context of real-time fault-tolerant scheduling in multi-processor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant rate-monotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit (ERMBF) based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Liu C L, Layland J W. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment[J]. Journal of ACM, 1973, 20(1): 46–61.
Dhall S K, Liu C L. On a Real-Time Scheduling Problem[J].Operations Research, 1978, 26(1): 127–140.
Srinivasan S, Jha N K. Safety and Reliability Driven Task Allocation in Distributed Systems[J]. IEEE Trans Parallel and Distributed Systems, 1999, 10(3): 238–251.
Yang C H, Deconinck G, Gui W. Fault-Tolerant Scheduling for Real-Time Embedded Control Systems[J]. Journal of Computer Science and Technology, 2004, 19(2): 191–202.
Wang F, Ramamritham K, Stankovic J. Determining Redundancy Levels for Fault-Tolerant Real-Time Systems[J]. IEEE Transactions on Computers, 1995,44(2): 292–301.
Liu H, Fei S M. A Fault-Tolerant Scheduling Algorithm Based on EDF for Distributed Control Systems[J]. Chinese Journal of Computers, 2003, 14(8): 1371–1378(Ch).
Luo W, Yang F M, Pang L P, et al. Fault-Tolerant Scheduling Based on Periodic Tasks for Heterogeneous Systems[C]// Proc 3rd Int Conf Autonomic and Trusted Computing. Wuhan: Springer, 2006: 571–580.
Bertossi A A, Mancini L V, Rossini F. Fault-Tolerant Rate Monotonic First-Fit Scheduling in Hard-Real-Time Systems[J]. IEEE Trans Parallel and Distributed Systems, 1999, 10(9): 934–945.
Yang C H, Ji L, Sheng D Y, et al. Fault-Tolerant Scheduling Based on the BEST-FIT Heuristics for Real Time Multiprocessor Systems[J]. Computer Engineer and Science, 2003, 25(5):61–64(Ch).
Pandya P. Finding Response Times in a Real-Time System[J]. The Computer J, 1986, 29(1): 390–395.
Author information
Authors and Affiliations
Additional information
Foundation item: Supported by the National Basic Research Program of China (973 Program 2004 CB318200)
Biography: YANG Fumin (1966–), male, Professor, research direction: real-time systems, embedded systems.
Rights and permissions
About this article
Cite this article
Yang, F., Luo, W. & Pang, L. An efficient real-time fault-tolerant scheduling algorithm based on multiprocessor systems. Wuhan Univ. J. of Nat. Sci. 12, 113–116 (2007). https://doi.org/10.1007/s11859-006-0231-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11859-006-0231-x