http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
정일용 한국멀티미디어학회 2013 멀티미디어학회논문지 Vol.16 No.7
The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping di, where 0≤i≤⌈logdN⌉−1. In this paper, we investigate the routing of a message on G(2m,4), a special kind of RCN, that is key to the performance of this network. On G(2m,4) we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the ith packet will be transmitted along the ith path, where 1≤k≤m−1, 0≤i<m−1. In order for all packets to arrive at a destination node quickly and securely, we present an O(m4) routing algorithm on G(2m,4) for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.