Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
On computing a conditional edge-connectivity of a graph
Information Processing Letters
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Graph Theory With Applications
Graph Theory With Applications
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Processor Allocation in Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
IEEE Transactions on Computers
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
Edge-cuts leaving components of order at least three
Discrete Mathematics
IEEE Transactions on Computers
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance in n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
Methods for distributed unicast in hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
Note on the connectivity of line graphs
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Super connectivity of line graphs
Information Processing Letters
The super connectivity of shuffle-cubes
Information Processing Letters
Lower bounds on the vertex-connectivity of digraphs and graphs
Information Processing Letters
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
On reliability of the folded hypercubes
Information Sciences: an International Journal
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Fault-tolerant analysis of a class of networks
Information Processing Letters
Restricted arc-connectivity of digraphs
Information Processing Letters
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
The super connectivity of augmented cubes
Information Processing Letters
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
On static and dynamic partitioning behavior of large-scale P2P networks
IEEE/ACM Transactions on Networking (TON)
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
The restricted arc connectivity of Cartesian product digraphs
Information Processing Letters
The super connectivity of shuffle-cubes
Information Processing Letters
Super connectivity of line graphs
Information Processing Letters
Conditional diagnosability of alternating group networks
Information Processing Letters
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
One-to-one communication in twisted cubes under restricted connectivity
Frontiers of Computer Science in China
Cyclic vertex connectivity of star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
The super connectivity of exchanged hypercubes
Information Processing Letters
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Theoretical Computer Science
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Upper bounds on the connection probability for 2-D meshes and tori
Journal of Parallel and Distributed Computing
Edge fault tolerance of graphs with respect to super edge connectivity
Discrete Applied Mathematics
Broadcast in the locally k-subcube-connected hypercube networks with faulty tolerance
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Super restricted edge connectivity of regular edge-transitive graphs
Discrete Applied Mathematics
λ'-Optimality of Bipartite Digraphs
Information Processing Letters
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
Conditional diagnosability of balanced hypercubes under the MM∗ model
The Journal of Supercomputing
Edge-fault tolerance of hypercube-like networks
Information Processing Letters
Discrete Applied Mathematics
Hi-index | 15.02 |
In developing deterministic measures of system-level fault tolerance for multiple-processor systems, it has generally been assumed that any subset of system components (processors or links) can potentially fail at the same time. In the present work, the author generalizes these measures by restricting the potentially faulty sets to some subsets of the system components. Using this model, he presents a fault-tolerance analysis for the n-cube networks that shows that such networks can tolerate up to 2n-3 processor failures and remain connected provided that for each processor p in the network, all the processors which are directly connected to p do not fail at the same time. He also shows that in this situation the diameter of the network may increase only by a constant value. The author presents an O((kn)/sup 2/) time algorithm for determining if the network is disconnected when a set of k faulty processors, kor=2n-2, is given. The previously known algorithms for the same purpose require O(n*2/sup n-1/) computation steps.