메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
Multicomputer systems based on message passing draw attractions in the field of high performance computing, where loop or data parallelism is a main source of parallel processing. When exploiting parallelism on multicomputers, however, we confront several challenging problems. First, the nodes of multicomputer are likely to be heterogeneous with respect to computing power and workload. To minimize the elapsed time of program, loads should be balanced according to the performance of nodes. In addition, various dynamic failures should be managed appropriately. Lastly, selecting a proper number of nodes in a node pool is also desirable to achieve good performance.
We propose a new dynamic load balancing scheme called RAS to simultaneously deal with the three issues. RAS solves the load-balancing problem and dynamic failures by a work stealing mechanism, and the processor selection problem by data distribution based on a reservation scheme. According to our experiments on an IBM SP2 with matrix multiplication and ray tracing, RAS has shown better performance than other algorithms such as static chunk and weighted factoring under a shared running environment and even under the dedicated running environment.

목차

Abstract

Ⅰ. Introduction

Ⅱ. Previous Work

Ⅲ. RAS Algorithm

Ⅳ. Experimental Results

Ⅴ. Conclusions

References

저자소개

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-017769472