Sciweavers

194 search results - page 3 / 39
» Hypercube Network Fault Tolerance: A Probabilistic Approach
Sort
View
DSN
2000
IEEE
14 years 10 days ago
From Crash Fault-Tolerance to Arbitrary-Fault Tolerance: Towards a Modular Approach
This paper presents a generic methodology to transform a protocol resilient to process crashes into one resilient to arbitrary failures in the case where processes run the same te...
Roberto Baldoni, Jean-Michel Hélary, Michel...
IPPS
1997
IEEE
14 years 4 days ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
DSN
2007
IEEE
14 years 2 months ago
Fault Tolerant Approaches to Nanoelectronic Programmable Logic Arrays
Programmable logic arrays (PLA), which can implement arbitrary logic functions in a two-level logic form, are promising as platforms for nanoelectronic logic due to their highly r...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
ISPAN
1999
IEEE
14 years 6 days ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno
TPDS
1998
73views more  TPDS 1998»
13 years 7 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang