scholarly journals On Fractional Dynamic Faults with Threshold

2006 ◽  
pp. 197-211 ◽  
Author(s):  
Stefan Dobrev ◽  
Rastislav Královič ◽  
Richard Královič ◽  
Nicola Santoro
Keyword(s):  
Dynamic Faults

Broadcasting in synchronous networks with dynamic faults

Networks ◽  
1996 ◽  
Vol 27 (4) ◽  
pp. 309-318 ◽  
Author(s):  
B. S. Chlebus ◽  
K. Diks ◽  
A. Pelc
Keyword(s):  
Dynamic Faults

scholarly journals Analysis of Dynamic Faults in Embedded-SRAMs: Implications for Memory Test

2005 ◽  
Vol 21 (2) ◽  
pp. 169-179 ◽  
Author(s):  
Simone Borri ◽  
Magali Hage-Hassan ◽  
Luigi Dilillo ◽  
Patrick Girard ◽  
Serge Pravossoudovitch ◽  
...  
Keyword(s):  
Memory Test ◽  
Dynamic Faults

Broadcasting in hypercubes and star graphs with dynamic faults

1998 ◽  
Vol 66 (6) ◽  
pp. 321-326 ◽  
Author(s):  
Gianluca De Marco ◽  
Ugo Vaccaro
Keyword(s):  
Star Graphs ◽  
Dynamic Faults

OPTIMAL BROADCASTING IN TORI WITH DYNAMIC FAULTS

2002 ◽  
Vol 12 (01) ◽  
pp. 17-22 ◽  
Author(s):  
S. DOBREV ◽  
I. VRTO
Keyword(s):  
Additional Assumption ◽  
Communication Mode ◽  
Time Step ◽  
Dynamic Faults

We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links of the network can be faulty. Moreover the faults are dynamic. The problem is to determine the minimum broadcasting time if at most 2n - 1 faults are allowed in any step. In [4], it was shown that the broadcasting time is at most diameter+O(1), provided that k is limited by a polynomial of n. In our paper we drop this additional assumption and prove that the broadcasting can be always done in time diameter +2. The bound is the best possible.

Sign in / Sign up

Export Citation Format

Share Document