Sciweavers

6 search results - page 1 / 2
» Fault-tolerant meshes with minimal numbers of spares
Sort
View
SPAA
2000
ACM
13 years 9 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
CAL
2004
13 years 4 months ago
An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
María Engracia Gómez, José Du...
SPDP
1991
IEEE
13 years 8 months ago
Fault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
13 years 11 months ago
A Novel Low Overhead Fault Tolerant Kogge-Stone Adder Using Adaptive Clocking
— As the feature size of transistors gets smaller, fabricating them becomes challenging. Manufacturing process follows various corrective design-for-manufacturing (DFM) steps to ...
Swaroop Ghosh, Patrick Ndai, Kaushik Roy
NPC
2004
Springer
13 years 10 months ago
A Fully Adaptive Fault-Tolerant Routing Methodology Based on Intermediate Nodes
Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the pre...
Nils Agne Nordbotten, María Engracia G&oacu...