본문 바로가기
HOME> 논문 > 논문 검색상세

논문 상세정보

토러스 다중컴퓨터를 위한 입출력 자원의 배치와 성능 분석
Placement and Performance Analysis of I/O Resources for Torus Multicomputer

안중석    (한컴기술연구소 개발실  );
  • 초록

    Performance bottleneck of parallel computer systems has mostly been I/O devices because of disparity between processor speed and I/O speed. Therefore I/O node placement strategy is required such that it can minimize the number of I/O nodes, I/O access time and I/O traffic in an interconnection network. In this paper, we propose an optimal distance-k embedding algorithm, and analyze its effect on system performance when this algorithm is applied to n x n torus architecture. We prove this algorithm is an efficient I/O node placement using software simulation. I/O node placement using the proposed algorithm shows the highest performance among other I/O node placements in all cases. It is because locations of I/O nodes are uniformly distributed in the whole network, resulting in reduced traffic in the intE'rconnection network.


  • 참고문헌 (15)

    1. Concurrent file system - Making highly parallel mass storage transparent , S. Cannon , Proceedings. of Supercomputing '89, St. Petersberg / v.,pp.,
    2. Deadlock-free message routing in multiprocessor interconnection networks , W. J. Dally;C. L. Seitz , IEEE Transations on Computers / v.C-36,pp.,
    3. Disk I/O in high-performance computing systems , D. Jensen , Ph.D Dissertation, University of Illinois / v.,pp.,
    4. Optimal hot spot allocation on meshes for large-scale data-parallel algorithms , S. Y . Lee;C. M. Chen , IEEE Transactions on Parallel and Distributed Systems / v.6,pp.788-802,
    5. Design, analysis, and simulation of I/O architectures for hypercube multiprocessors , A. L. N. Reddy;P. Banerjee , IEEE Transactions on Parallel and Distributed Systems / v.1,pp.140-151,
    6. D. Reed.;R. Fujimoto , Multicomputer Networks / v.,pp.,
    7. E. A. Brewer;C. N. Dellarocas , PROTEUS User Documentation, 545 Technology Square(0.5 edition) / v.,pp.,
    8. K. Hwang , Advanced Computer Architecture / v.,pp.,
    9. Parallel I/O subsystems for hypercube multicomputers , J. Ghosh;B. Agarwal , Proceedings of the Fifth International Parallel Processing Symposium / v.,pp.381-384,
    10. Lee distance and topological properties of k-ary n-cubes , B. Bose(et al.) , IEEE Transactions on Computers / v.44,pp.1021-1030,
    11. Resource placement in k-ary n-cubes , P. Ramanathan;S. Chalasani , '89 International Conference on Parallel Processing / v.,pp.Ⅱ-133-Ⅱ-140,
    12. I/O embeddings in hypercubes , A. L. N. Reddy;P. Banerjee;S. G. Abraham , Proc. 1988 Int. Conference on Parallel Processing / v.,pp.318-338,
    13. Performance evaluation of a paralle I/O subsystem for hypercube multicomputers , J. Ghosh(et al.) , Journal of Parallel and Distributed Computing / v.17,pp.96-106,
    14. The MIT alewife machine: a large-scale distributed-memory multiprocessor , A. Agarwal(et al.) , Scalable Shared-Memory Multiprocessors / v.,pp.,
    15. E. R. Berlekamp , Algebraic coding theory / v.,pp.,

 활용도 분석

  • 상세보기

    amChart 영역
  • 원문보기

    amChart 영역

원문보기

무료다운로드
  • NDSL :
유료다운로드

유료 다운로드의 경우 해당 사이트의 정책에 따라 신규 회원가입, 로그인, 유료 구매 등이 필요할 수 있습니다. 해당 사이트에서 발생하는 귀하의 모든 정보활동은 NDSL의 서비스 정책과 무관합니다.

원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.

NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.

이 논문과 함께 출판된 논문 + 더보기