Nonadaptive fault-tolerant file transmission in rotator graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 4, 1996, Pages 477-482

  Hamada, Yukihiro ^a   Bao, Feng ^a   Mei, Aohan ^a   Igarashi, Yoshihide ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Connectivity; Fault tolerance; File transmission; Information dispersal algorithm; Rotator graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PROBABILITY; RELIABILITY;

CONNECTIVITY; INFORMATION DISPERSAL ALGORITHM; NONADAPTIVE FAULT TOLERANT FILE TRANSMISSION; ROTATOR GRAPHS;

ALGORITHMS;

EID: 0030123416     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. P.F. CorbettRotator graphs: an efficient topology for point-to-point multiprocessor networks IEEE Trans. Parallel & Distributed Syst., vol.3, pp.622-626, 1992.
2. T. Hagerup and C. RubA guided tour of Chernoff bounds Infor. Process. Lett., vol.33, pp.305-308, 1990.
3. F.T. LeightonIntroduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes Morgan Kaufman Publishers, San Mateo, 1992.
4. Y-D. LyuuFast fault-tolerant parallel communication for de Bruijn and digit-exchange networks using information dispersal Networks, vol.23, pp.365-378, 1993.
5. M.O. RabinEfficient dispersal of information for security, load balancing, and fault tolerance J. ACM, vol.36, pp.335-348, 1989.
6. P.M. Yamakawa, H. Ebara, and H. NakanoA routing algorithm in a faulty n-rotator graph Proc. Joint Symposium on Parallel Processing, pp.65-72, 1994.