Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPPS
2010
IEEE
10 years 11 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
TPDS
2010
142views more  TPDS 2010»
10 years 12 months ago
Toward Optimal Network Fault Correction in Externally Managed Overlay Networks
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
JSA
2000
116views more  JSA 2000»
11 years 1 months ago
A fault tolerant routing algorithm based on cube algebra for hypercube systems
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan...
CN
2006
191views more  CN 2006»
11 years 1 months ago
Detection and diagnosis of data inconsistency failures in wireless sensor networks
Most fault-tolerant schemes for wireless sensor networks focus on power failures or crash faults. Little attention has been paid to the data inconsistency failures which occur whe...
Kuo-Feng Ssu, Chih-Hsun Chou, Hewijin Christine Ji...
EUROPDS
1997
11 years 2 months ago
A Highly Fault-Tolerant Circuit-Switched Hypercube
In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare nod...
Baback A. Izadi, Füsun Özgüner, Adn...
ISCAPDCS
2004
11 years 2 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
SIROCCO
2008
11 years 2 months ago
Locating and Repairing Faults in a Network with Mobile Agents
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
Colin Cooper, Ralf Klasing, Tomasz Radzik
ICPP
1995
IEEE
11 years 5 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu
ICPP
1997
IEEE
11 years 5 months ago
Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube
In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with k j ...
Baback A. Izadi, Füsun Özgüner
IPPS
1998
IEEE
11 years 5 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
books