By Topic

A Performance-based Dynamic Loop Partitioning on Grid Computing Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chao-Tung Yang ; Dept. of Comput. Sci., Tunghai Univ., Taichung, Taiwan ; Lung-Hsing Cheng

Loop scheduling on parallel and distributed systems has been a critical problem. Furthermore, it becomes more difficult to deal with on the emerging heterogeneous grid environments. In the past, some loop self-scheduling schemes have been proposed to be applicable to heterogeneous gird environments. In this paper, we propose a performance-based approach, which partitions loop iterations according to the performance weight of nodes. To verify the proposed approach, a grid testbed that consists four schools is built, and matrix multiplication example is implemented to be executed in this testbed. Experimental results show that the proposed approach performs better than previous schemes.

Published in:

High Performance Computing and Communications, 2009. HPCC '09. 11th IEEE International Conference on

Date of Conference:

25-27 June 2009