Abstract
The distributed recovery block (DRB) is an efficient approach for the uniform treatment of hardware and software faults in real-time applications. Full DRB mapping assigns each task of an application tasks graph to run on a pair of processor nodes. The primary cost factors that determine its efficiency are dilation bound, expansion factor and congestion. In this paper, two alternative schemes are described that improves the DRB approach. The first describes a mapping of application tasks such that each node in the hypercube executes one or more application tasks in the lifetime of a task graph. The second scheme incorporates spare processors to provide an efficient architecture for implementing the DRB approach.
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.
