Title :
Design and evaluation of dynamic key message algorithms for cluster computing
Author :
Wang, Yang ; Zhu, Ming ; Guo, Zhuang ; Ding, Meng
Author_Institution :
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.
Abstract :
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
Keywords :
critical path analysis; parallel algorithms; software performance evaluation; workstation clusters; centralized predictor dynamic algorithm; cluster computing; distributed dynamic algorithm; dynamic key message algorithms; fixed critical path dynamic algorithm; parallel application; Algorithm design and analysis; Cities and towns; Clustering algorithms; Communication networks; Component architectures; Concurrent computing; Hardware; Heuristic algorithms; Protocols; Traffic control;
Conference_Titel :
High-Performance Computing in Asia-Pacific Region, 2005. Proceedings. Eighth International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7695-2486-9
DOI :
10.1109/HPCASIA.2005.31
