Abstract
With the improvement of personal computers and high-speed net-work, clusters have become the trend in designing high performance computing environments. As the researches of relative hardware and software technology of Cluster and Grid are constantly improved, the application of Cluster is growing popular. Due to information progress and increasing calculation capacity required by all kind of applications; the calculation has also extended to cross-network calculation. Through the Internet, which connects several Clusters, the mass calculation platform is combined into Cluster Grid. As a result of data partition and exchange that may happen during the executing program, communication localization becomes important in programming efficiency. This paper, then, proposes a mathematical method which achieves excellent data partitioning and maintains data calculation in local environment. We also conduct some theoretical analysis on the amounts of computing nodes and data partition in the hope of being applied to practical parallel environment and further to reduce communication cost.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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, p. 98 (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, pp. 26–33. AAAI Press, Menlo Park (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, p. 191 (2003)
Foster, I., Kessclman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
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)
Hsu, C.H., Lin, G.H., Li, K.C., Yang, C.T.: Localization Techniques for Cluster-Based Data Grid. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds.) ICA3PP 2005. LNCS, vol. 3719, pp. 83–92. Springer, Heidelberg (2005)
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)
Knoop, J., Mehofer, E.: Distribution assignment placement: Effective optimization of redistribution costs. IEEE TPDS 13(6), 628–647 (2002)
Kalns, E.T., Ni, L.M.: Processor mapping techniques toward efficient data redistribution. IEEE TPDS 6(12), 1234–1247 (1995)
Kim, D.H., Kang, K.W.: Design and Implementation of Integrated Information System for Monitoring Resources in Grid Computing. In: Computer Supported Cooperative Work in Design, 10th Conf., pp. 1–6 (2006)
Lim, Y.W., Bhat, P.B., Parsanna, V.K.: Efficient algorithm for block-cyclic redistribution of arrays. Algorithmica 24(3-4), 298–330 (1999)
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, p. 121 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, CC., Chen, SC., Hsu, CH., Yang, CT. (2008). Optimizing Communications of Data Parallel Programs in Scalable Cluster Systems. In: Wu, S., Yang, L.T., Xu, T.L. (eds) Advances in Grid and Pervasive Computing. GPC 2008. Lecture Notes in Computer Science, vol 5036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68083-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-68083-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68081-9
Online ISBN: 978-3-540-68083-3
eBook Packages: Computer ScienceComputer Science (R0)