ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A Review Of Fault Tolerant Scheduling In Multicore Systems

Journal: International Journal of Scientific & Technology Research (Vol.4, No. 5)

Publication Date:

Authors : ; ; ; ; ;

Page : 132-136

Keywords : Keywords multicore processor; fault tolerant; dynamic scheduling; check-pointing; Earliest Deadline First; Task Graph; etc.;

Source : Downloadexternal Find it from : Google Scholarexternal


Abstract In this paper we have discussed about various fault tolerant task scheduling algorithm for multi core system based on hardware and software. Hardware based algorithm which is blend of Triple Modulo Redundancy and Double Modulo Redundancy in which Agricultural Vulnerability Factor is considered while deciding the scheduling other than EDF and LLF scheduling algorithms. In most of the real time system the dominant part is shared memory.Low overhead software based fault tolerance approach can be implemented at user-space level so that it does not require any changes at application level. Here redundant multi-threaded processes are used. Using those processes we can detect soft errors and recover from them. This method gives low overhead fast error detection and recovery mechanism. The overhead incurred by this method ranges from 0 to 18 for selected benchmarks. Hybrid Scheduling Method is another scheduling approach for real time systems. Dynamic fault tolerant scheduling gives high feasibility rate whereas task criticality is used to select the type of fault recovery method in order to tolerate the maximum number of faults.

Last modified: 2015-06-28 04:10:46