Abstract
The advent of widely interconnected computing resources introduces the technologies of grid computing. A typical grid system, the cluster grid, consists of several clusters located in multiple campuses that distributed globally over the Internet. Because of the Internet infrastructure of cluster grid, the communication overhead becomes as key factor to the performance of applications on cluster grid. In this paper, we present a processor reordering technique for the communication optimizations of data parallel programs on cluster grid. The alignment of data in parallel programs is considered as example to examine the proposed techniques. Effectiveness of the processor reordering technique is to reduce the inter-cluster communication overheads and to speedup the execution of parallel applications in the underlying distributed clusters. Our preliminary analysis and experimental results of the proposed method on mapping data to logical grid nodes show improvement of communication costs and conduce to better performance of parallel programs on different hierarchical grid of cluster systems.
The work of this paper was supported by NCHC, National Center for High Performance Computing and NSC, National Science Council of Taiwan, under grant number NCHC-KING-010200 and NSC-93-2213-E-216-028, respectively.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Taiwan UniGrid, http://unigrid.nchc.org.tw
Beaumont, O., Legrand, A., Robert, Y.: Optimal algorithms for scheduling divisible workloads on heterogeneous systems. In: Proceedings of the 12th IEEE Heterogeneous Computing Workshop (2003)
Bal, H.E., Plaat, A., Bakker, M.G., Dozy, P., Hofman, R.F.H.: Optimizing Parallel Applications for Wide-Area Clusters. In: Proceedings of the 12th International Parallel Processing Symposium IPPS 1998, pp. 784–790 (1998)
Blythe, J., Deelman, E., Gil, Y., Kesselman, C., Agarwal, A., Mehta, G., Vahi, K.: The role of planning in grid computing. In: Proceedings of ICAPS 2003 (2003)
Dawson, J., Strazdins, P.: Optimizing User-Level Communication Patterns on the Fujitsu AP3000. In: Proceedings of the 1st IEEE International Workshop on Cluster Computing, pp. 105–111 (1999)
Foster, I.: Building an open Grid. In: Proceedings of the second IEEE international symposium on Network Computing and Applications (2003)
Foster, I., Kessclman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999) ISBN 1-55860-475-8
Foster, I., Kessclman, C.: Globus: A metacomputing infrastructure toolkit. Intl. J. Supercomputer Applications 11(2), 115–128 (1997)
Frey, J., Tannenbaum, T., Livny, M., Foster, I., Tuccke, S.: Condor-G: A Computation Management Agent for Multi-Institutional Grids. Journal of Cluster Computing 5, 237–246 (2002)
Lee, S., Yook, H.-G., Koo, M.-S., Park, M.-S.: Processor reordering algorithms toward efficient GEN_BLOCK redistribution. In: Proceedings of the 2001 ACM symposium on Applied computing (2001)
Guo, M., Nakata, I.: A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers. The Journal of Supercomputing 20(3), 243–265 (2001)
Isaila, F., Tichy, W.F.: Mapping Functions and Data Redistribution for Parallel Files. In: Proceedings of IPDPS 2002 Workshop on Parallel and Distributed Scientific and Engineering Computing with Applications, Fort Lauderdale (April 2002)
Koonp, J., Mehofer, E.: Distribution assignment placement: Effective optimization of redistribution costs. IEEE TPDS 13(6) (June 2002)
Kalns, E.T., Ni, L.M.: Processor mapping techniques toward efficient data redistribution. IEEE TPDS 6(12), 1234–1247 (1995)
Lim, Y.W., Bhat, P.B., Parsanna, V.K.: Efficient algorithm for block-cyclic redistribution of arrays. Algorithmica 24(3-4), 298–330 (1999)
Plaat, A., Bal, H.E., Hofman, R.F.H.: Sensitivity of Parallel Applications to Large Differences in Bandwidth and Latency in Two-Layer Interconnects. In: Proceedings of the 5th IEEE High Performance Computer Architecture HPCA 1999, pp. 244–253 (1999)
Qin, X., Jiang, H.: Dynamic, Reliability-driven Scheduling of Parallel Real-time Jobs in Heterogeneous Systems. In: Proceedings of the 30th ICPP, Valencia, Spain (2001)
Ranaweera, S., Agrawal, D.P.: Scheduling of Periodic Time Critical Applications for Pipelined Execution on Heterogeneous Systems. In: Proceedings of the 30th ICPP, Valencia, Spain (2001)
Spooner, D.P., Jarvis, S.A., Caoy, J., Saini, S., Nudd, G.R.: Local Grid Scheduling Techniques using Performance Prediction. IEE Proc. Computers and Digital Techniques 150(2), 87–96 (2003)
Zhu, M., Cai, W., Lee, B.-S.: Key Message Algorithm: A Communication Optimization Algorithm in Cluster-Based Parallel Computing. In: Proceedings of the 1st IEEE International Workshop on Cluster Computing (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, CH., Lo, TT., Yu, KM. (2005). Localized Communications of Data Parallel Programs on Multi-cluster Grid Systems. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds) Advances in Grid Computing - EGC 2005. EGC 2005. Lecture Notes in Computer Science, vol 3470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508380_92
Download citation
DOI: https://doi.org/10.1007/11508380_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26918-2
Online ISBN: 978-3-540-32036-4
eBook Packages: Computer ScienceComputer Science (R0)