A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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. ... We show that the hypercube networks are strongly fault-tolerant. Simulation results analyze to accomplish algorithm characteristics under many node faults. ... CONCLUSION This paper introduced an optimal broadcast algorithm for the hypercube networks using spanning trees. ...doi:10.5281/zenodo.1105517 fatcat:rn6njqdtvvfcfn4a3ga2z3ltfa
However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. ... We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal. ... However,  pointed out their potential as fault-tolerant multiprocessor networks. ...doi:10.1080/00207160701691431 fatcat:lsgmm63panbtjatqvdoe37eb7e
Besides, we im-Bagherzadeh et al.  by calculating the cycle structure sage to a node without another nonfaulty neighbors. we shall propose an efficient fault-tolerant broadcasting algorithm. ... In this paper, we shall prove the fault tolerance of star graphs is 2n -5 shall propose an algorithm for examining the connecalgorithm requires O(n310gn) tame. ... For example, both of them are edge symmetric, node symmetric, strongly hierarchical, bipartite and optimally fault tolerant. But star graphs offer a better degree and diameter than hypercubes. ...doi:10.1142/s0129054197000112 fatcat:e7umthe7n5b4hgr6xg3jbjfzzq
As direct applications of this method we give an exact analysis of a known algorithm for the POSTAL model, and design and analyze an optimal broadcast algorithm for the MULTI_PORT MULTI_MEDIA model. ... multiprocessors connected in an n-dimensional hypercube net- work. ...
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. ... Index Terms-Broadcast subcube, fault-tolerant broadcasting, hypercube, local safety, maximal safe subcube. ... This section presents: the sufficient condition for the existence of an optimal broadcasting, a fault-tolerant broadcast algorithm, the sufficient condition for optimal broadcasting by the Algorithm. ...doi:10.1109/tr.2003.810071 fatcat:cizma5iewresjnx5bgk3o6xiau
However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. ... We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal. ... However,  pointed out their potential as fault-tolerant multiprocessor networks. ...doi:10.4218/etrij.09.0208.0404 fatcat:r5mauydrezaapfgmnmdt2kxzb4
The scheme outlined here, which sends duplicate messages, can tolerate at most a single fault. In an n-dimensional hypercube, there are n parallel paths be- tween any pair of nodes. ... Also, under light load, mean latency with fault-tolerant routing is about the same as that of Katseff’s algorithm, but, not surprisingly, the fault-tolerant al- gorithm saturates at half the throughput ...
We take advantage of the hierarchical structure of the Star graph network and the Varietal hypercube to obtain an efficient method for constructing the new topology. ... This paper proposes a new interconnection network topology, called the Star varietalcube SVC(n,m), for large scale multicomputer systems. ... Tripathy, Dept. of CSE & IT for his encouragement and technical guidance throughout the research work. ...doi:10.47893/ijcns.2011.1018 fatcat:jfcjaijs3rdffhqup3inuskmcy
Banerjee [Prithviraj Banerjee], Algorithm- based fault tolerance for adaptive least squares lattice filtering on a hypercube multiprocessor (pp. 177-180); Min-You Wu and Wei Shu, Performance estimation ... Reeves, Fault-tolerant matrix operations on hypercube multiprocessors (pp. 169-176); R. B. Mueller-Thuns, D. McFarland and P. ...
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. ... The probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. ... Lan  has presented a fault-tolerant routing algorithm based on local information, and which guarantees an optimal or near-optimal routing. ...doi:10.1093/comjnl/44.5.368 fatcat:7odpcsrzebarvgdfkkapxhehla
(I-SLRN-I2; Baronissi); Rescigno, A. A. (I-SLRN-I2; Baronissi); Vaccaro, U. (I-SLRN-I2; Baronissi) Fault-tolerant hypercube broadcasting via information dispersal. ... An imple- mentation of FQF is presented and a fast method for simulating PS is derived. John P. ...
An algorithm for general graphs is developed, by reduction to a maximum- flow minimum-cost problem, that finds a cost-optimal distribution strategy, given a graph and an initial token allocation. ... Our main result is an algorithm for graphs that are lines of nodes; it finds the distribution strategy in time O(n), for a line of n nodes.” 99¢:68015 68M10 Diks, Krzysztof (PL-WASW-I; Warsaw); Kranakis ...
Summary: “We present an off-line method for routing a linear complement permutation on a hypercube. The routing has the virtue of being congestion-free. ... ; Santa Barbara, CA) Optimal communication algorithms for Manhattan Street networks. ...
Summary: “We specify and prove correctness of a real-world fault- tolerance algorithm. The algorithm, developed by J. M. Chang and N. F. Maxemchuk [ACM Trans. Comput. ... Systems (USA) 2 (1984), no. 3, 251-273; CCA 1984:50293], guarantees delivery of broadcast messages over a broadcast medium (e.g., an ethernet) in the pres- ence of faults that may cause messages to be ...
To make a CCC-based parallel computer more resilient to node/link faults, this paper proposes an optimal routing method that guarantees to find a shortest path between the source and the destination nodes ... The CCC network possesses the features of symmetry, regularity, fault tolerance, and fixed degree of the network. ... FAULT-TOLERANT ROUTING ALGORITHM For a multicomputer/multiprocessor system based on the CCC topology, information may be exchanged frequently among the computing nodes through the interconnecting links ...doi:10.1007/s11227-017-2033-7 fatcat:b67vfjz6nbbwplle3egywa6nra
« Previous Showing results 1 — 15 out of 286 results