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 it? efJiciency 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.
The star graph has been proposed as an attractive alternative to the hypercube offering a lower degree, a smaller diameter, and a smaller distance for a similar number of nodes. In this paper we describe two fault tolerant routing algorithms for star networks subject to link failure(s). Both algorithms use the disjoint redundant paths between source and destination to bypass the faulty links. Both algorithms guarantee successful routing in an n-star if the number of link failures is leas than n-1. For higher number of link failures, we analyze their fault tolerant routing capability by Probability of Successful Routing ( P S R ) and Expected Routing Distance (ERD) and compare these results against similar fault tolerant routing algorithm on hypercube.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.