정보처리학회논문지A (The KIPS Transactions:PartA)

한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

하이퍼-스타 연결망의 위상적 성질과 방송 알고리즘

Topological Properties and Broadcasting Algorithm of Hyper-Star Interconnection Network

  • 발행 : 2004.10.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

최근에 병렬처리를 위한 새로운 위상으로 하이퍼-스타 그래프 HS(m, k)가 제안되었다. 하이퍼-스타 그래프는 하이퍼큐브와 스타 그래프의 성질을 가지고 있으면서, 같은 노드수를 갖는 하이퍼큐브 보다 망비용이 우수한 그래프이다 본 논문에서는 하이퍼-스타 그래프 HS(m, k)가 하이퍼큐브의 서브그래프임을 증명한다. 그리고 정규형 그래프인 하이퍼-스타 HS(2n, n)가 제안된 매핑 기법에 의해 노드 대칭임을 보이며, 최소 높이를 갖는 스패닝 트리를 이용한 일-대-다 방송 기법을 제안하고, 방송 수행 시간이 2n-1임을 보인다.

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

키워드

참고문헌

  1. S. B. Akers, D. Harel and B. Krishnamurthy, 'The star graph: An attractive alternative to the n-cube,' Proc. of the Int. Conf. Parallel Processing, pp.216-223, 1986
  2. D-R. Duh, G-H. Chen and J-F. Fang, 'Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules,' IEEE Trans. Parallel and Distributed Systems, Vol.6, No.7, pp.714-723, July, 1995 https://doi.org/10.1109/71.395400
  3. A. H. Esfahanian, L. M. Ni and B. E. Sagan, 'The Twisted N-Cube with Application to Multiprocessing,' IEEE Trans. Comput., VoI.40, No.1, pp.88-93, Jan., 1991 https://doi.org/10.1109/12.67323
  4. S. L. Johnsson, 'Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures,' Journal of Parallel Distributed Comput., Vol.4, pp.133-172, 1987 https://doi.org/10.1016/0743-7315(87)90002-5
  5. J, Kim and K-G. Shin, 'Operationally Enhanced Folded Hypercubes,' IEEE Trans. Parallel and Distributed Systems, VoI.5, No.12, pp.1310-1316, 1994 https://doi.org/10.1109/71.334904
  6. H.-O. Lee, J.-S. Kim, E. Oh, H.-S. Lim, 'Hyper-Star Graph : A New Interconnection Network Improving the Network Cost of the Hypercube,' Lecture Notes in Computer Science: EurAsia-ICT 2002, LNCS 2510, PP. 858-865, 2002
  7. F. T. Leighton, 'Introduction to Parallel Algorithms and Architectures: Arrays, Hypercubes,' Morgan Kaufmann Publishers, 1992
  8. V. E. Mendia nad D. Sarkar, 'Optimal Broadcasting on the Star Graph,' IEEE Trans. Parallel Distributed syst., VoI.3, No.4, pp.389-396, 1992 https://doi.org/10.1109/71.149958
  9. A. S. Vaidya, P. S. N. Rao and S. r. Shankar, 'A Class of Hypercube_like Networks,' Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing, pp. 800-803, 1993 https://doi.org/10.1109/SPDP.1993.395450
  10. S.-K. Yun and K.-H. Park, 'Comments on Hierarchical Cubic Networks,' IEEE Trans. Parallel Distributed syst., VoI.9, No.4, pp.410-414, 1998 https://doi.org/10.1109/71.667900