FESTAL: fault-tolerant elastic scheduling algorithm for real-time tasks in virtualized clouds

Wang, Ji, Bao, Weidong, Zhu, Xiaomin, Yang, Laurence T. and Xiang, Yang 2015, FESTAL: fault-tolerant elastic scheduling algorithm for real-time tasks in virtualized clouds, IEEE transactions on computers, vol. 64, no. 9, pp. 2545-2558, doi: 10.1109/TC.2014.2366751.

Attached Files
Name Description MIMEType Size Downloads

Title FESTAL: fault-tolerant elastic scheduling algorithm for real-time tasks in virtualized clouds
Author(s) Wang, Ji
Bao, Weidong
Zhu, Xiaomin
Yang, Laurence T.
Xiang, YangORCID iD for Xiang, Yang orcid.org/0000-0001-5252-0831
Journal name IEEE transactions on computers
Volume number 64
Issue number 9
Start page 2545
End page 2558
Total pages 14
Publisher IEEE
Place of publication Piscataway, N.J.
Publication date 2015-09-01
ISSN 0018-9340
Keyword(s) Science & Technology
Computer Science, Hardware & Architecture
Engineering, Electrical & Electronic
Computer Science
fault-tolerant scheduling
primary-backup model
Summary As clouds have been deployed widely in various fields, the reliability and availability of clouds become the major concern of cloud service providers and users. Thereby, fault tolerance in clouds receives a great deal of attention in both industry and academia, especially for real-time applications due to their safety critical nature. Large amounts of researches have been conducted to realize fault tolerance in distributed systems, among which fault-tolerant scheduling plays a significant role. However, few researches on the fault-tolerant scheduling study the virtualization and the elasticity, two key features of clouds, sufficiently. To address this issue, this paper presents a fault-tolerant mechanism which extends the primary-backup model to incorporate the features of clouds. Meanwhile, for the first time, we propose an elastic resource provisioning mechanism in the fault-tolerant context to improve the resource utilization. On the basis of the fault-tolerant mechanism and the elastic resource provisioning mechanism, we design novel fault-tolerant elastic scheduling algorithms for real-time tasks in clouds named FESTAL, aiming at achieving both fault tolerance and high resource utilization in clouds. Extensive experiments injecting with random synthetic workloads as well as the workload from the latest version of the Google cloud tracelogs are conducted by CloudSim to compare FESTAL with three baseline algorithms, i.e., Non-M igration-FESTAL (NMFESTAL), Non-Overlapping-FESTAL (NOFESTAL), and Elastic First Fit (EFF). The experimental results demonstrate that FESTAL is able to effectively enhance the performance of virtualized clouds.
Language eng
DOI 10.1109/TC.2014.2366751
Field of Research 0803 Computer Software
0805 Distributed Computing
1006 Computer Hardware
080403 Data Structures
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30082274

Document type: Journal Article
Collections: School of Information Technology
2018 ERA Submission
Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 8 times in TR Web of Science
Scopus Citation Count Cited 33 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 113 Abstract Views, 4 File Downloads  -  Detailed Statistics
Created: Thu, 17 Mar 2016, 13:02:22 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.