Abstract
The past decade has witnessed the rapid development of cloud computing. Virtualization, which is the fundamental technique in providing Infrastructure as a Service (IaaS), has led to an explosive growth of the cloud computing industry. Fault-tolerance is a significant requirement of cloud computing due to the Service Level Agreements (SLA). In order to achieve high reliability and resilience of real-time systems in virtualized clouds, a Virtualization-based Fault-Tolerant Scheduling (VFTS) algorithm is proposed. In this paper, fault tolerance is implemented by using primary-backup approach. VFTS is designed for periodic and preemptive tasks in homogeneous environment. Simulation results demonstrate an impressing saving of processing resources compared with those needed by the dual-system hot backup approach, which proves the feasibility and effectiveness of the proposed VFTS algorithm.
References
Mell, P.M., Grance, T.: The NIST definition of cloud computing. Technical report, National Institute of Standards and Technology, Gaithersburg (2011)
Nanda, S., Chiueh, T.: A survey on virtualization technologies. Technical report, Department of Computer Science, SUNY at Stony Brook (2005)
Stankovic, J.: Misconceptions about real-time computing: a serious problem for next-generation systems. Computer 21(10), 10–19 (1988)
Bertossi, A., Mancini, L., Rossini, F.: Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems. IEEE Trans. Parallel Distrib. Syst. 10(9), 934–945 (1999)
Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic. Real-Time Tasks. Perform. Eval. 2(4), 237–250 (1982)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
Joseph, M., Pandya, P.: Finding response times in a real-time system. Comput. J. 29(5), 390–395 (1986)
Dhall, S.K., Liu, C.L.: On a real-time scheduling problem. Oper. Res. 26(1), 127–140 (1978)
Ghosh, S., Melhem, R., Mosse, D.: Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 8(3), 272–284 (1997)
Bertossi, A., Mancini, L., Menapace, A.: Scheduling hard-real-time tasks with backup phasing delay. In: 10th IEEE International Symposium on Distributed Simulation Real-Time Applications, pp. 107–118. IEEE (2006)
Tindell, K.: Adding Time-Offsets to Schedulability Analysis, pp. 1–28. University of York, Deparment of Compututer Science (1994)
Wang, J., Bao, W., Zhu, X., Yang, L.T., Xiang, Y.: FESTAL: fault-tolerant elastic scheduling algorithm for real-time tasks in virtualized clouds. IEEE Trans. Comput. 64(9), 2545–2558 (2015)
Acknowledgment
This work was supported in part by the National Natural Science Foundation of China under Grant No. 61332010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Guo, P., Xue, Z. (2018). Real-Time Fault-Tolerant Scheduling Algorithm in Virtualized Clouds. In: Chen, Q., Meng, W., Zhao, L. (eds) Communications and Networking. ChinaCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 210. Springer, Cham. https://doi.org/10.1007/978-3-319-66628-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-66628-0_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66627-3
Online ISBN: 978-3-319-66628-0
eBook Packages: Computer ScienceComputer Science (R0)