Energy-Aware Fault-Tolerant Scheduling Under Reliability and Time Constraints in Heterogeneous Systems

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As heterogeneous systems have been deployed widely in various fields, the reliability become the major concern. Thereby, fault tolerance receives a great deal of attention in both industry and academia, especially for safety critical systems. Such systems require that tasks need to be carried out correctly in a given deadline even when an error occurs. Therefore, it is imperative to support fault-tolerance capability for systems. Scheduling is an efficient approach to achieving fault tolerance by allocating multiple copies of tasks on processors. Existing fault-tolerant scheduling algorithms realize fault tolerance without energy limit. To address this issue, this paper proposes an energy-aware fault-tolerant scheduling algorithm DRB-FTSA-E. The algorithm adopts the active replication strategy and uses a high utilization of energy consumption to complete a set of tasks with given reliability and time constraints. It finds out all schemes that meet time and system reliability constraints, and chooses the scheme with the maximum utilization of energy consumption as the final scheduling scheme. Experimental simulation results show that the proposed algorithm can effectively achieve the maximum utilization of energy consumption while meeting the reliability and time constraints.

Cite

CITATION STYLE

APA

Guo, T., Liu, J., Hu, W., & Wei, M. (2018). Energy-Aware Fault-Tolerant Scheduling Under Reliability and Time Constraints in Heterogeneous Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10956 LNAI, pp. 36–46). Springer Verlag. https://doi.org/10.1007/978-3-319-95957-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free