대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

다중포트 통신에서의 재귀원형군에 대한 최적 방송

Optimal Broadcasting in Recursive circulants under Multi-port Communication

  • 최정 (기전여자대학 사무자동화과) ;
  • 이형옥 (전남대학교 전산통계학과) ;
  • 임형석 (전남대학교 전자통계학과)
  • Choi, Jung (Dept. of Office Automation, Kijeon Women's College) ;
  • Lee, Hyeong-Ok (Dept. of Computer Science and Statistics, Chonnam National Univ.) ;
  • Lim, Hyeong-Seok (Dept. of Computer Science and Statistics, Chonnam National Univ.)
  • 발행 : 1998.10.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we consider the problem of optimal broadcasting in recursive circulants under multi-port communication model. Recursive circulant G(N, d) that is defined to be a circulant graph with N vertices and jumps of powers of d is a useful interconnection network from the viewpoint of network metrices. Our model assumes that a processor can transmit a message to $\alpha$ neighboring processors simultaneously where $\alpha$ is two or three. For the broadcasting problem, we introduce 3-trees and 4-trees. And then we show that 3-trees and 4-trees are minimum broadcast trees in 2-port model and 3-port model. Using the above results, we show that recursive circulants g(2m, 2) have optimum broadcasting time in 2-port model and 3-port model.

키워드