• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.580-583
• /
• 2008

본 논문은 정이진트리(full binary tree)를 PT 네트워크에 임베딩 가능함을 보인다. 메쉬 네트워크에 H-트리을 생성하는 방법을 응용하여 밀집을 1, 확장율 ${\doteqdot}5$ 그리고 연장율 $\frac{3(n+1)}{4}+1$에 일대일 임베딩 하였다. 밀집을 1에 임베딩 함으로써 store-and-forward 라우팅 방식과 윔홀 라우팅 방식에 적합하며 일대일 임베딩 함으로써 프로세서의 부하를 줄였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.10-15
• /
• 2002

This paper proposes the Pipelined Broadcast that broadcasts a message of size m in O(m+n-1) time in an n-dimensional hypercube. It is based on the replication tree, which is derived from the reachable sets. It greatly improves the performance compared to Ho-Kao s algorithm with the time of O(m[n/log(n+1)]). The communication in the broadcast uses all-port wormhole router with message replication capability. This paper includes the algorithm together with performance comparisons to previous schemes in practical implementation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.65-74
• /
• 2002

Recently star 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 broadcasing 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 $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.