Effective Fault-tolerant Scheduling Algorithms for Real-time Tasks on Heterogeneous Systems

Abstract

Real-time systems are being increasingly used in several applications which are time critical in nature. Tasks corresponding to these applications have deadlines to be met. Due to the catastrophic consequences of not tolerating faults, fault-tolerance is also an important requirement of such systems. In this paper, we use the common Primary/Backup (PB) scheme to propose three algorithms, which are used to schedule real-time tasks with fault-tolerant requirements on heterogeneous systems. Our algorithms are modified and extended from existed algorithms, and aim at enhancing their performances without increasing the time complexity. Based on our simulation, all of them can achieve expected results. Besides, one of them also can use lower scheduling cost to obtain reasonable performances, which make it become much effectively and efficiently.