SHERP

A Robust Dynamic Load-balancing Scheme for Data Parallel Application on Multicomputer Systems

Cited 0 time in webofscience Cited 0 time in scopus
Authors
Kee, Yangsuk; Ha, Soonhoi
Issue Date
1999-02
Publisher
한국정보과학회 = Korean Institute of Information Scientists and Engineers
Citation
Journal of Electrical Engineering and Information Science Vol. 4 No.1, pp. 105-114, 1999
Keywords
data parallelismmulticomputerdynamic load balancingprocessor selection
Abstract
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 a 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.
ISSN
1226-1262
Language
English
URI
http://uci.or.kr/G300-j12261262.v4n1p105

http://hdl.handle.net/10371/8859
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Computer Science and Engineering (컴퓨터공학부)Journal Papers (저널논문_컴퓨터공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse