A solution to the three disjoint path problem on honeycomb meshes

Parallel Processing Letters

Volumn 14, Issue 3-4, 2004, Pages 399-410

  Yang, Xiaofan ^a   Megson, 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 mesh; Interconnection topology

Indexed keywords

COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; INTERCONNECTION NETWORKS; MAPPING; PARALLEL ALGORITHMS;

DATA DEPENDENCY GRAPHS; FAULT-TOLERANTING ROUTING; HONEYCOMB MESHES (HM); INTERCONNECTION TOPOLOGY;

PROBLEM SOLVING;

EID: 21144446442     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626404001982     Document Type: Article

References (5)

1. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introducing 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. Milutinovic, V. Milutinovic, and B. Soucek, "The honeycomb architecture," Computer, vol. 20, no. 4, pp. 81-83, 1987.
4. V. Milutinovic, "Mapping of neural networks on the honeycomb architecture," Proc. IEEE, vol. 77, no. 12, pp. 1875-1878, 1989.
5. I. Stojmenovic, "Honeycomb networks: topological properties and communication algorithms," IEEE Trans. Parallel & Distributed Systems, vol. 8, no. 10, pp. 1036-1042, 1997.