419 Hits in 4.0 sec

On optimal broadcasting in faulty hypercubes

Jehoshua Bruck
1994 Discrete Applied Mathematics  
One application of this construction is a technique to perform broadcasting in a hypercube with faulty links.  ...  (ii) Every tree in D, is of depth n, which is the optimal depth. (iii) Every edge in the n-cube is shared by at most two trees in D,.  ...  One of the applications of this construction is to broadcasting in a hypercube with at most [n/21 -1 faulty edges.  ... 
doi:10.1016/0166-218x(94)90175-9 fatcat:qltrvhpatrh7xcdxvap3ksgyfe

Optimal broadcasting in hypercubes with link faults using limited global information

Jie Wu
1996 Journal of systems architecture  
We .also show that n -2 is the maximum number of faulty links that can be tolerated in any optimal broadcast scheme in an n-dimensional hypercube.  ...  In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n -2 faulty links.  ...  Acknowledgements Thanks to Tianan Wu for providing help in obtaining simulation results.  ... 
doi:10.1016/s1383-7621(96)00023-9 fatcat:vtlhjidqkjc67pnghgj2uh54wi

Reliable broadcasting in wormhole-routed hypercube-connected networks using local safety information

Dong Xiang, Ai Chen, Jie Wu
2003 IEEE Transactions on Reliability  
This paper presents a method to cope with reliable broadcasting in faulty hypercubes using local safety information.  ...  The sufficient condition for optimal broadcast of a message is presented in an unsafe hypercube. Extensive simulation results show that the proposed method outperforms previous methods, in all cases.  ...  One-to-all fault-tolerant broadcasting passes a message from a source to all fault-free nodes in a faulty hypercube [8] , [12] , [13] , [15] - [17] .  ... 
doi:10.1109/tr.2003.810071 fatcat:cizma5iewresjnx5bgk3o6xiau

Fault-Tolerant Optimal Broadcast Algorithm For The Hypercube Topology

Lokendra Singh Umrao, Ravi Shankar Singh
2015 Zenodo  
This paper presents an optimal broadcast algorithm for the hypercube networks. The main focus of the paper is the effectiveness of the algorithm in the presence of many node faults.  ...  Fu's approach cannot tolerate n − 1 faulty nodes in the worst case, but our approach can tolerate n − 1 faulty nodes.  ...  Algorithm 1: Broadcasting procedure Input: an n-dimensional hypercube H n with faulty processes and at least one non-faulty process p i in H n Output: the broadcast paths from p i in H n of non-faulty  ... 
doi:10.5281/zenodo.1105517 fatcat:rn6njqdtvvfcfn4a3ga2z3ltfa

Safety levels-an efficient mechanism for achieving reliable broadcasting in hypercubes

Jie Wu
1995 IEEE transactions on computers  
An optimal broadcast initiated from a safe node is proposed.  ...  When a nonfaulty source node is unsafe and there are at most n -1 faulty nodes in an injured n-dimensional hypercube, the proposed broadcasting scheme requires at most n + 1 steps.  ...  INJURED HYPERCUBE BROADCASTING In this section, we consider an optimal broadcasting scheme using the incomplete spanning binomial tree structure.  ... 
doi:10.1109/12.381957 fatcat:th2iygvxzjd53m6hdw3duur5si

Page 3442 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
Summary: “Embedding meshes in hypercubes has been studied extensively. Most earlier works on embedding in faulty hypercubes considered edge failures as node failures.  ...  In this paper, we present results on embedding meshes in hypercubes with edge faults.  ... 

Optimal broadcasting in injured hypercubes using directed safety levels

Jie Wu
2003 Journal of Parallel and Distributed Computing  
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper.  ...  Simulation results show a signi cant improvement in terms of optimal broadcast capability in injured hypercubes.  ...  Simulation results have shown a signi cant improvement in terms of optimal broadcast capability in an injured hypercube using the directed safety l e v el model, compared with the one using the safety  ... 
doi:10.1016/s0743-7315(03)00065-0 fatcat:6lmfinns5vd7zfzpnio4dl7puq

Broadcasting on incomplete hypercubes

Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang
1993 IEEE transactions on computers  
Abstract-Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes.  ...  The broadcasting algorithm is strictly optimal.  ...  hardware, and hypercubes with faulty nodes.  ... 
doi:10.1109/12.247842 fatcat:jyqp3j5tkzbb5eutdtwn6vrhwe

Optimal 2-bit branch predictors

R. Nair
1995 IEEE transactions on computers  
It also presents results from using this technique to determine optimal 4-state branch predictors for applications in the SPEC89 benchmark suite running on the IBM RW6000.  ...  This paper presents an efficient technique to analyze finitestate machines to determine an optimal one for branch prediction.  ...  We define an injured hypercube [2] as a connected hypercube with faulty nodes. Broadcasting in an injured hypercube is defined as successful broadcasting of a datum to all the nonfaulty nodes.  ... 
doi:10.1109/12.381956 fatcat:ytgbwvlejrgdvor4z5iqzenuwq

Page 2935 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
In general, the fault tolerance of a broadcasting scheme depends not only on the configuration of faulty processors, but also on the start round of broadcasting.  ...  We describe broadcasting schemes on such networks in a general form. The general form includes a scheme on hypercubes, the binary jumping scheme, and its variations.  ... 

Page 2042 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
Summary: “We study hypercube networks with a very large num- ber of faulty nodes.  ...  For a locally subcube-connected hypercube network that may contain up to 37.5 percent faulty nodes, our algorithms run in linear time and, for any two given nonfaulty nodes, find a routing path of length  ... 

Broadcasting with linearly bounded transmission faults

L. Ga̧sieniec, A. Pelc
1998 Discrete Applied Mathematics  
Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no effect.  ...  For the hypercube and the complete graph, broadcasting in the linearly bounded fault model can be performed in time logarithmic in the number of nodes. 0 1998 Elsevier Science B.V.  ...  We show that in both cases this time is logarithmic in the number of nodes. In the case of the hypercube we obtain the exact value of r-safe broadcasting time and give an optimal algorithm.  ... 
doi:10.1016/s0166-218x(97)00107-8 fatcat:7zyxtfcogfc4fad67zy3ixv7g4

Probability-based Fault-tolerant Routing in Hypercubes

J. Al-Sadi
2001 Computer journal  
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors.  ...  To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links.  ...  The concept of unsafe nodes has also been used in [23] to achieve broadcasting in faulty hypercubes.  ... 
doi:10.1093/comjnl/44.5.368 fatcat:7odpcsrzebarvgdfkkapxhehla

Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks

Hossein Habibian, Ahmad Patooghy
2017 Journal of Supercomputing  
within a faulty CCC-based network if such a path exists.  ...  The proposed method is based on the concepts of radiation and backtracking and is able to find the shortest path with little impact on the network traffic load.  ...  However, in the presence of two faulty nodes and one broken link, only one shortest path remains, which is depicted with thick directed edges.  ... 
doi:10.1007/s11227-017-2033-7 fatcat:b67vfjz6nbbwplle3egywa6nra

Fault-tolerant Routing in Dual-cubes Based on Routing Probabilities

Junsuk Park, Yuki Hirai, Keiichi Kaneko
2015 Procedia Computer Science  
This limitation has been complemented in a dual-cube. In this paper, we propose a fault-tolerant routing algorithm in a dual-cube based on routing probabilities.  ...  A binary hypercube has been used as an interconnection network topology in parallel computers for large-scale computing.  ...  They have shown that the broadcasting in the dual-cube can be completed in optimal time under the restricted one-port communication model 10 .  ... 
doi:10.1016/j.procs.2015.10.007 fatcat:i442sla24ffghp5pxmk2y5fv7m
« Previous Showing results 1 — 15 out of 419 results