A new channel routing algorithm called DTR (Defect-Tolerant Routing) is investigated. This algo-rithm minimizes the total area and simultaneously maximizes the performance by reducing the critical area which can potentially be the source of logical faults caused by the bridging effects of spot defects. Experimental results show DTR produces less critical area than Yoshimura&Kuh’s algorithm[l]. 1
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
This paper introduces a new, practical routing algorithm, Maze-routing, to tolerate faults in networ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...
Traditionally, the goal of channel routing algorithms is to route the nets with as few tracks as pos...
This paper provides an introduction to Delay Tolerant Networks (DTN)alogorithms and would touch upon...
Massively parallel computing systems are being built with hundreds or thousands of components such a...
We consider the problem of routing in delay tolerant networks de-ployed in developing regions. Altho...
[[abstract]]©2003 World Scientific Publishing-In wormhole meshes, many a routing algorithm prevents ...
Computers get faster every year, but the demand for computing resources seems to grow at an even fas...
The ability to tolerate faults is critical in multicomputer employing large numbers of processors. T...
Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including dis...
Computers get faster every year, but the demand for computing resources seems to grow at an even fas...
[[abstract]]©2003-A routing algorithm able to tolerate two faulty blocks with a distance of two, no ...
Abstract—Fault-tolerant routing is the ability to survive failure of individual components and usual...
Designing routing schemes is a multidimensional and complex task that depends on the objective funct...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
This paper introduces a new, practical routing algorithm, Maze-routing, to tolerate faults in networ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...
Traditionally, the goal of channel routing algorithms is to route the nets with as few tracks as pos...
This paper provides an introduction to Delay Tolerant Networks (DTN)alogorithms and would touch upon...
Massively parallel computing systems are being built with hundreds or thousands of components such a...
We consider the problem of routing in delay tolerant networks de-ployed in developing regions. Altho...
[[abstract]]©2003 World Scientific Publishing-In wormhole meshes, many a routing algorithm prevents ...
Computers get faster every year, but the demand for computing resources seems to grow at an even fas...
The ability to tolerate faults is critical in multicomputer employing large numbers of processors. T...
Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including dis...
Computers get faster every year, but the demand for computing resources seems to grow at an even fas...
[[abstract]]©2003-A routing algorithm able to tolerate two faulty blocks with a distance of two, no ...
Abstract—Fault-tolerant routing is the ability to survive failure of individual components and usual...
Designing routing schemes is a multidimensional and complex task that depends on the objective funct...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
This paper introduces a new, practical routing algorithm, Maze-routing, to tolerate faults in networ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...
DOI
Add to ORKG