Abstract
Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit (FTRMFF) algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic (RM) algorithm. Then, the RM-based idleness factor and compact factor are presented to quantify the compact degree of tasks assigned to the same processor. In this paper, the novel fault-tolerant rate-monotonic compact-factor-driven (FTRMCFD) algorithm, which follows the principle of compact factor maximal when allocating the processors for tasks, is proposed. FTRMCFD algorithm makes every processor contain more tasks and get higher utilization to increase the schedulability performance of distributed systems. The simulation experiments reveal that FTRMCFD can reduce the number of required processors by up to 11.5% (with an average of 5.3%).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bertossi A A, Mancini L V, Menapace A. Scheduling hard-real-time tasks backup phasing delay[C]//Proc of the 10th IEEE Intl Symp on Distributed Simulation and Real-Time Applications. Los Alamitos: IEEE Computer Society, 2006: 107–116.
Yang Fumin, Luo Wei, Pang Liping. An efficient real-time fault-tolerant scheduling algorithm based on multiprocessor systems[J]. Wuhan University Journal of Natural Sciences, 2007, 12(1): 113–116.
Wang J, Sun J L, Wang X Y, et al. Efficient scheduling algorithm for hard real-time tasks in primary-backup based multiprocessor systems[J]. Journal of Software, 2009, 20(10): 2628–2636.
Bertossi A A, Mancini L V, Rossini F. Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems[J]. IEEE Transactions on Parallel and Distributed Systems, 1999, 10(9): 934–945.
Yang C H, Deconinck G. A fault-tolerant reservation-based strategy for scheduling aperiodic tasks in multiprocessor systems[C]//Proc the 10th IEEE Euromicro Workshop on Parallel, Distributed and Network-based Processing. Gran Canaria: IEEE Computer Society, 2002: 319–326.
Al-Omari R, Somani A K, Manimaran G. A new fault-tolerant technique for improving schedulability in multiprocessor real-time systems[C]//Proc the 15th IEEE Parallel and Distributed Processing Symposium, San Francisco: IEEE Computer Society, 2001: 32–33.
Yang Chunhua, Gui Weihua, Li Ji. A fault-tolerant scheduling algorithm of hybrid real-time tasks based on distributed systems[J]. Chinese Journal of Computers, 2003, 26(11): 1479–1486 (Ch).
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.
Joseph M, Pandya P. Finding response times in a real-time system[J]. The Computer Journal, 1986, 29(3): 390–395.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60603032)
Biography: ZHU Ping, female, Ph. D. candidate, research direction: real-time systems, fault-tolerant scheduling.
Rights and permissions
About this article
Cite this article
Zhu, P., Yang, F. & Tu, G. Fault-tolerant rate-monotonic compact-factor-driven scheduling in hard-real-time systems. Wuhan Univ. J. Nat. Sci. 15, 217–221 (2010). https://doi.org/10.1007/s11859-010-0307-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-010-0307-5