Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 1998.06a
- /
- Pages.297-300
- /
- 1998
Parallel Paths in Honeycomb Network
Honeycomb 연결망에서의 병렬 경로
- Kim, Cheol (Dept. of Computer Science, Chonnam Univ.) ;
- Lee, Hyeong-Ok (Dept. of Computer Science, Chonnam Univ.) ;
- Lim, Hyeong-Seok (Dept. of Computer Science, Chonnam Univ.)
- Published : 1998.06.01
Abstract
A honeycomb network is considered as a multiprocessor interconnection network. The network cost defined as the product of degree and diameter is better for honeycomb networks than for other types of meshes. Parallel paths offer us bypasses when the networks have faulty nodes or edges. In this paper, we present a method to construct a parallel path in honeycomb network, and show that the fault diameter for the honeycomb network is d+8, where d is diameter of the honeycomb network.
Keywords