대한전자공학회논문지 (Journal of the Korean Institute of Telematics and Electronics)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

매트릭스를 이용한 혼합교환도의 배치 알고리즘

The Placement Algorithm of the Shuffle-Exchange Graph Using Matrix

  • 하기종 (한국전기통신공사 사업지원본부) ;
  • 최영규 (중앙대학교 전자공학과) ;
  • 황호정 (중앙대학교 전자공학과)
  • Hah, Ki Jong (Maintenance Centralization Lab., Korea Telecomunication Authority Research Center) ;
  • Choi, Young Kyoo (Dept. of Elec. Eng., Chung-Ang Univ.) ;
  • Hwang, Ho Jung (Dept. of Elec. Eng., Chung-Ang Univ.)
  • 발행 : 1987.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The shuffle-exchange graph is known as a structure to perform the parallel algorithms like Discrete Fourier Transform(DFT), matrix multiplication and sorting. In this paper, the layout for the shuffle-exchange graph is described and this layout places emphasis on the placement of nodes that has the capability to have as small area as possible, have as a small number of crossings as possible, and have as short wires as possible. The algorithm corrdsponding these conditions is proposed and each evaluation factor and the placement of the N-node shuffle-exchange graph is performed with FORTRAN and BASIC program, and these results are calcualted.

키워드