A solution to the three disjoint path problem on honeycomb tori

Parallel Processing Letters

Volumn 14, Issue 3-4, 2004, Pages 411-422

  Yang, Xiaofan ^a   Mengson, Graham M ^b   Zhang, Shaomin ^c   Liu, Xiaoping ^d  

^a CHONGQING UNIVERSITY   (China)

^b UNIVERSITY OF READING   (United Kingdom)

^c SHENYANG UNIVERSITY OF TECHNOLOGY   (China)

^d WUHAN UNIVERSITY   (China)

Author keywords

Fault tolerant routing; Honeycomb torus; Interconnection topology

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS; TOPOLOGY; VLSI CIRCUITS;

FAULT-TOLERANTING ROUTING; HONEYCOMB MESHES (HM); HONEYCOMB TORUS; INTERCONNECTION TOPOLOGY;

PROBLEM SOLVING;

EID: 21144434664     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626404001994     Document Type: Article

References (6)

1. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to parallel Computing: Design and Analysis of Algorithms (The Benjamin/Cummings Publishing Company, Inc. 1994).
2. S. G. Akl, The Design and Analysis of parallel Algorithms (Prentice-Hall International, Inc. 1989).
3. D. Milutionvic, V. Milutionvic, and B. soucek, "the honeycomb architecture," Computer, 20 (4) (1987) 81-83.
4. V. Milutionvic, "mapping of neural networks on the honeycomb architecture," Proc. IEEE, 77 (12) (1989) 1875-1878.
5. I. Stojmenovic, "honeycomb networks: topological properties and communication algorithms" IEEE Trans. Parallel & distributed Systems, 8 (10) (1997) 1036-1042.
6. X. Yang, G. M. Megson, S. Zhang, and X. Liu, "A solution to the three disjoint path problem on honeycomb meshes," Parallel Processing Letters, 14 (3-4) (2004).