Abstract
Deadline scheduling means that the task with the earliest required response time is processed (earliest deadline first). In many points this kind of scheduling is superior to fixed priority scheduling. This work investigates the applicability of dynamic deadline scheduling in fault tolerant multicomputer systems with active redundancy and asynchronous scheduling. Tasks are preemptive and are subject to precedence constraints. It is shown that the additional computation resources necessary for fault situations can be reduced by relating the error detection timer to the deadline. If however the usual methods of deadline scheduling are applied deadlines can be missed. A new technique of deadline scheduling meeting all requirements for fault tolerant systems is proposed.
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.
