다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
멀티미디어학회논문지 = Journal of Korea Multimedia Society, v.18 no.9, 2015년, pp.1083 - 1090
Choi, Dongmin (Division of Undeclared Majors, Chosun University) , Chung, Ilyong (Dept. of Computer Engineering, Chosun University)
AI-Helper
A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to trans...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
S. Tang, Y. Wang, and C. Li, “Generalized Recursive Circulant Graphs,” IEEE Transactions on Parallel Distributed Systems, Vol. 23, No. 1, pp. 87-93, 2012.
S.L. Johnson and C. Ho, “Optimum Broadcasting and Personalized Communication in Hypercube,” IEEE Transactions on Computer, Vol. 38, No. 9, pp. 1249-1268, 1989.
M.O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” Journal of Association for Computing Machinery, Vol. 36, No. 2, pp. 335-348, 1989.
I. Chung, “Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube,” Journal of Korea Information Science Society, Vol. 19, No. 5, pp. 569-578, 1992.
Y. Shih and S. Kao, “One-to-one Disjoint Path Covers on K-ary N-cubes,” Theoretical Computer Science, Vol. 412, No. 35, pp. 4513-4530, 2011.
K. Day and A. Tripathi, “Comparative Study of Topological Properties of Hypercubes and Star Graphs,” IEEE Transactions on Parallel Distributed Systems, Vol. 8, No. 1, pp. 1196-1202, 1994.
S. Gao, B. Novick, and K. Qiu, “From Hall Matching Theorem to Optimal Routing on Hypercubes,” Journal of Combinatorial Theory, Series B, Vol. 74, Issue 2, pp. 291-301, 1998.
C. Lai, “Two Conditions for Reducing the Maximal Length of Node-Disjoint Paths in Hypercubes,” Theoretical Computer Science, Vol. 418, pp. 82-91, 2012.
Q. Gu and S. Peng, “Cluster Fault-Tolerant Routing in Star Graph,” Networks, Vol. 35, No. 1, pp. 83-90, 2000.
S. Madhavapeddy and I. H. Sudborough, “A Topogical Property of Hypercubes: Node Disjoint Paths,” Proceedings of the Second IEEE Symposium on Parallel Distributed Processing, pp. 532- 539, 1990.
J. Zhou, Z. Wu, S. Yang, and K. Yuan, ”Symmetric Property and Reliability of Balanced Hypercube,” IEEE Transactions on Computers, Vol. 64, No. 3, pp. 876-881, 2015.
Y. Cho and I. Chung, “A Parallel Routing Algorithm on Circulant Networks Employing the Hamiltonian Circuit Latin Square,” Information Sciences, Vol. 176, No. 21, pp. 3132-3142, 2006.
D. Choi, O. Lee, and I. Chung, “A Parallel Routing Algorithm on Recursive Cube of Rings Networks Employing Hamiltonian Circuit Latin Square,” Information Sciences, Vol. 178, No. 6, pp. 1533-1541, 2008.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.