An optimal broadcasting algorithm without message redundancy in star graphs

1995 ◽  
Vol 6 (6) ◽  
pp. 653-658 ◽  
Author(s):  
Jang-Ping Sheu ◽  
Chao-Tsung Wu ◽  
Tzung-Shi Chen
Keyword(s):  
Star Graphs ◽  
Broadcasting Algorithm

Fault Tolerance on Star Graphs

1997 ◽  
Vol 08 (02) ◽  
pp. 127-142 ◽  
Author(s):  
Shuo-Cheng Hu ◽  
Chang-Biau Yang
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Constant Time ◽  
Multiprocessor Systems ◽  
Star Graph ◽  
Cycle Structure ◽  
Star Graphs ◽  
Broadcasting Algorithm

The capability of fault tolerance is one of the advantages of multiprocessor systems. In this paper, we prove that the fault tolerance of an n-star graph is 2n-5 with restriction to the forbidden faulty set. And we propose an algorithm for examining the connectivity of an n-star graph when there exist at most 2n - 4 faults. The algorithm requires O(n2 log n) time. Besides, we improve the fault-tolerant routing algorithm proposed by Bagherzadeh et al. by calculating the cycle structure of a permutation and the avoidance of routing message to a node without any nonfaulty neighbor. This calculation needs only constant time. And then, we propose an efficient fault-tolerant broadcasting algorithm. When there is no fault, our broadcasting algorithm remains optimal. The penalty is O(n) if there exists only one fault, and the penalty is O(n2) if there exist at most n - 2 faults.

scholarly journals Oriented diameter of star graphs

2021 ◽  
Author(s):  
K.S. Ajish Kumar ◽  
Deepak Rajendraprasad ◽  
K.S. Sudeep
Keyword(s):  
Star Graphs

scholarly journals A method of sharing secrecy using star graphs

2021 ◽  
Vol 1070 (1) ◽  
pp. 012002
Author(s):  
G Prasad ◽  
R Anandan ◽  
G Uma Maheswari
Keyword(s):  
Star Graphs

ANALYSIS OF A LATENCY HIDING BROADCASTING ALGORITHM ON A RECONFIGURABLE OPTICAL INTERCONNECT

2002 ◽  
Vol 12 (01) ◽  
pp. 41-50 ◽  
Author(s):  
AHMAD AFSAHI ◽  
NIKITAS J. DIMOPOULOS
Keyword(s):  
Recurrence Relations ◽  
Single Port ◽  
Optical Network ◽  
Parallel Computer ◽  
Optical Interconnection ◽  
Free Space Optical ◽  
Loosely Coupled ◽  
Collective Communications ◽  
Broadcasting Algorithm ◽  
Termination Time

Free-space optical interconnection is used to fashion a reconfigurable network. Since network reconfiguration is expensive compared to message transmission in such networks, latency hiding techniques can be used to increase the performance of collective communications operations. Berthome and Ferreira have recently proposed a broadcasting algorithm for their loosely-coupled optically reconfigurable parallel computer where they have shown that the total number of nodes, N(S), informed up to step S follows a recurrence relation. We have adapted their algorithm to our reconfigurable optical network, RON (K, N), which has slightly different modeling. We present a new analysis of this broadcasting algorithm on our network. This paper contributes by providing closed formulations for the N(S) that yield the termination time for both single-port and k-port modeling. The derived closed formulate are easier to computer than the recurrence relations.

Sign in / Sign up

Export Citation Format

Share Document