By Topic

Design and evaluation of dynamic key message algorithms for cluster computing

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
$33 $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

4 Author(s)
Yang Wang ; Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada ; Ming Zhu ; Zhuang Guo ; Meng Ding

The Key Message (KM) approach prioritizes communications along the critical path to speed up the execution of parallel applications in a cluster environment. In this article, we introduce a family of three dynamic KM algorithms that take into account of the dynamic nature of underlying networks to improve over their predecessor. These three dynamic KM algorithms are: Fixed Critical Path Dynamic KM (FDKM), Centralized Predictor Dynamic KM (CDKM), and Distributed Dynamic KM (DDKM). Our performance study based on simulation showed that in general CDKM performs better and is more stable than FDKM and DDKM under heavy traffic conditions. The performance of DDKM is close to that of CDKM and better than that of FDKM on average. By taking advantages of both FDKM and CDKM, DDKM can be expected to be a promising optimization in a real cluster environment

Published in:

Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05)

Date of Conference:

Nov. 30 2005-Dec. 3 2005