지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2013.7
- 수록면
- 897 - 904 (8page)
이용수
초록· 키워드
오류제보하기
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 d i, where 0≤i≤?logd N??1. In this paper, we investigate the routing of a message on G(2<SUP>m</SUP>,4), a special kind of RCN, that is key to the performance of this network. On G(2<SUP>m</SUP>,4) we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the i <SUP>th</SUP> packet will be transmitted along the i <SUP>th</SUP> 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(m⁴) routing algorithm on G(2<SUP>m</SUP>,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.
목차
ABSTRACT
1. INTRODUCTION
2. DESIGN OF THE SHORTEST PATH
3. Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks
4. CONCLUSION
REFERENCES
참고문헌 (17)
참고문헌 신청
J. Park / 2009 / Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / IEEE Trans. Comput 58:528~540
Q. Zhu / 2007 / Reliability of the Folded Hypercubes / Info. Sci 177:1782~1788
J. Park / 2008 / Panconnectivity and Edge-Pancyclicity of faulty recursive circulant G(2m, 4) / Theoret. Comput. Sci. 390:70~80
S. Tang / 2012 / Genneralized recursive circulant graphs / IEEE Trans. Parall. Distr. Syst 23:87~93
I. Chung / 1992 / Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube / J. of Korea Info. Sci. Soc 19:569~578
Q. Zhu / 2007 / Reliability of the Folded Hypercubes / Info. Sci 177:1782~1788
J. Park / 2008 / Panconnectivity and Edge-Pancyclicity of faulty recursive circulant G(2m, 4) / Theoret. Comput. Sci. 390:70~80
S. Tang / 2012 / Genneralized recursive circulant graphs / IEEE Trans. Parall. Distr. Syst 23:87~93
I. Chung / 1992 / Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube / J. of Korea Info. Sci. Soc 19:569~578
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-000-002409111