상세 보기
초록
Recently, star graph networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasting. In this paper, we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system, minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths. We present a broadcast algorithm in n-dimensional star graph of N ( = n! ) nodes such that the total completion time is no larger than 「log (_n)n!」 + 1 steps, where 「log (_n)n!」 is the lower bound. This result is significant improvement over the previous n-1 step broadcasting algorithm.
키워드
- 제목
- 웜홀 라우팅을 지원하는 스타그래프 네트워크에서의 전 포트 브로드캐스팅 알고리즘
- 제목 (타언어)
- All-port Broadcasting Algorithms on Wormhole Routed Star Graph Networks
- 저자
- 김차영; 이상규; 이주영
- 발행일
- 2002-02
- 저널명
- 정보과학회논문지 : 시스템 및 이론
- 권
- 29
- 호
- 2
- 페이지
- 65 ~ 74