Abstract
Abstract Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. In this paper we propose a fault-tolerant scheduling heuristics for precedence task that is based on primary-backup replication scheme on a realistic platform model where communication contention is taken into account. We focus on a bi-criteria approach, where we aim at minimizing makespan (or the schedule length), and the other way take account into the failure probability of the application. We are able to let the user choose atrade-off between reliability maximization and makespan minimization. Major achievements include a low complexity and reduction of the number of additional communications by the replication and clustering mechanism. Simulation results show that in comparison to existing scheduling algorithms, the proposed scheduling algorithm improves the reliability and performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
