최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 시스템 및 이론, v.35 no.6, 2008년, pp.263 - 272
서정현 (순천대학교 컴퓨터공학) , 이형옥 (순천대학교 컴퓨터교육) , 장문석 (순천대학교 컴퓨터공학)
We propose and analyze a new interconnection network, called petersen-torus(PT) network based on well-known petersen graph. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same number of nodes. In this paper, we propose optimal routing algorithm and hamiltonian...
Ohring and S. K. DAS, "Folded Petersen cube networks: new competitors for the hypercubes," IEEE Transactions on Parallel and Distributed Systems, Vol.7, No.2, pp. 151-168, Feb 1996
K. W. Tang and S. A. Padubidri, "Diagonal and toroidal Mesh Networks," IEEE trans. comput., Vol.43, No.7, pp. 815-826, Jul 1994
I. Stojmenovic, "Honeycomb Network: Topological Properties and Commnication Algorithms," IEEE trans. on Parallel and Distributed Systems, Vol.8, No.10, pp. 1036-1042, Oct 1997
M. S. Chen and K. G. Shin, "Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors," IEEE trans. comput., Vol.39, No.1, pp. 10-18, Jan 1990
Y. Saad and M. H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Comput., Vol.37, No.7, pp. 867-872, July 1988
A. EI-Amawy and S. Latifi, "Properties and Performances of Folded Hypercubes," IEEE Trans. Parallel and Distributed System, Vol.2, No.1, pp. 31-42, 1991
K. Efe, "A Variation on the Hypercube with Lower Diameter," IEEE Trans. comput., Vol.40, No.11, pp. 1312-1316, 1991
J-H. Park, "Circulant Graphs and Their Application to Communication Networks," Ph.D. Thesis, Dept. of Computer Science, KAIST, Taejon Korea, 1992
V. E. Mendia and D. Sarkar, "Optimal Broadcasting on the Star Graph," IEEE Trans. Parallel and Distributed Systems, Vol.3, No.4, pp. 389-396, July 1992
C-H Yeh and E. Varvarigos, "Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs for Large-Scale Parallel Architectures," Frontier'96, Symp. on the Frontiers of Massively Parallel Computation, Oct. 1996
S. Latifi and P. K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks," IEEE Trans. Comput., Vol.45, No.2, pp. 230-238, Feb. 1996
H. O. Lee, J. S Kim, K. W. Park and J. H. Seo, "Matrix Star Graphs: A New Interconnection Network Based on Matrix Operations," Lecture Note in Computer Science : ACSAC 2005, LNCS 3740, pp. 478-487, Oct. 2005
V. Bokka, H. Gurla, S. Olariu and J. L. Schwing, "Podality-Based Time-Optimal Computations on Enhance Meshes," IEEE Trans. Parallel and Distributed System, Vol.8, No.10, pp. 1019-1035, Oct 1997
G. Memmi and Y. Raillrd, "Some New Results About the (d,k) Graph Problem," IEEE trans. comput., Vol.c-31, No.8 pp. 784-791, Aug 1982
K. W. Cattermole and J.P. Summer, "Communication networks based on the product graph," Proc. Inst. Elec. Eng., Vol.124, pp. 38-48, Jan 1977
K. W. Cattermole and J.P. Summer, "On the impossibility of certain Moore graph," J. combinatorial Theory (B), pp. 253-254, Apr 1966
E. Bannai and T. Ito, "On finite Moore graphs," J Fac. Sci., Tokyo Univ., pp. 191-208, 1973
R. M. Storwick, "Improved construction technique for (d,k) graphs," IEEE trans. Electron. Comput., pp. 1214-1216, Dec 1970
G. Chartrand and R.J. Wilson, "The Petersen graph," in Graphs and Applications, F. Harary and J.S. Maybee, eds., pp. 69-100, 1985
D.?A. Holton and J. Sheehan, "The Petersen Graph," in The Petersen Graph, Cambridge University Press, eds., pp. 1-45, 1993
C. H. Yeh and B. Parhami, "Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph," 1999 International Conference on Parallel Processing (ICPP'99), pp. 258-265, 1999
W. Lei and C. Zhiping, "Research on Petersen Graphs and Hyper-cubes Connected Interconnection Networks," ACASC 2006, LNCS 4186, pp. 495-501, 2006
S. K. Das and A. K. Banerjee, "Hyper Petersen network: yet another hypercube-like topology," Fourth Symposium on the Frontiers of Massively Parallel Computation, pp. 270-277, Oct 1992
※ AI-Helper는 부적절한 답변을 할 수 있습니다.