Abstract
Efficient scheduling algorithms are essential to irregular data redistribution in cluster grid. Cluster grid is an environment with heterogeneous computing nodes and complex network. It is important for schedulers to keep an eye on load balance and low communication cost while distributing different size of data segment on various processors. High Performance Fortran Version 2 (HPF2) provides GEN_BLOCK distribution format which facilitates generalized block distributions. In this paper, we present a message clustering technique to derive low communication cost when performing such operation in cluster grids. The main idea of the proposed technique is to cluster three kinds of messages and normalize the cost. The performance evaluation is given and show the proposed method successfully adapts to heterogeneous environment.
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.
Similar content being viewed by others
References
Bai, S.-W., Yang, C.-S.: Essential Cycle Calculation Method for Irregular Array Redistribution. IEICE Transactions on Information and Systems E89-D(2), 789–797 (2006)
Chang, R.-S., Chang, J.-S., Lin, S.-Y.: Job scheduling and data replication on data grids. Future Generation Computer Systems 23(7), 846–860 (2007)
Chen, S.-C., Hsu, C.-H.: ISO: Comprehensive Techniques Toward Efficient GEN_BLOCK Redistribution with Multidimensional Arrays. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 507–515. Springer, Heidelberg (2007)
Desprez, F., Dongarra, J., Petitet, A.: Scheduling Block-Cyclic Data redistribution. IEEE Transactions on Parallel and Distributed Systems 9(2), 192–205 (1998)
Guo, M., Pan, Y., Liu, Z.: Symbolic Communication Set Generation for Irregular Parallel Applications. The Journal of Supercomputing 25(3), 199–214 (2003)
Hsu, C.-H., Bai, S.-W., Chung, Y.-C., Yang, C.-S.: A Generalized Basic-Cycle Calculation Method for Efficient Array Redistribution. IEEE Transactions on Parallel and Distributed Systems 11(12), 1201–1216 (2000)
Hsu, C.-H., Chen, S.-C., Lan, C.-Y.: Scheduling Contention-Free Irregular Redistribution in Parallelizing Compilers. The Journal of Supercomputing 40(3), 229–247 (2007)
Huang, J.-W., Chu, C.-P.: A flexible processor mapping technique toward data localization for block-cyclic data redistribution. The Journal of Supercomputing 45(2), 151–172 (2008)
Huang, J.-W., Chu, C.-P.: An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution. The Journal of Supercomputing 37(3), 297–318 (2006)
Karwande, A., Yuan, X., Lowenthal, D.K.: An MPI prototype for compiled communication on ethernet switched clusters. Journal of Parallel and Distributed Computing 65(10), 1123–1133 (2005)
Lim, Y.W., Bhat, P.B., Prasanna, V.K.: Efficient Algorithms for Block-Cyclic Redistribution of Arrays. Algorithmica 24(3-4), 298–330 (1999)
Lin, C.-Y., Chung, Y.-C.: Data distribution schemes of sparse arrays on distributed memory multicomputers. The Journal of Supercomputing 41(1), 63–87 (2007)
Prylli, L., Touranchean, B.: Fast runtime block cyclic data redistribution on multiprocessors. Journal of Parallel and Distributed Computing 45(1), 63–72 (1997)
Sudarsan, R., Ribbens, C.J.: Efficient Multidimensional Data Redistribution for Resizable Parallel Computations. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds.) ISPA 2007. LNCS, vol. 4742, pp. 182–194. Springer, Heidelberg (2007)
Wang, H., Guo, M., Wei, D.: Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers. IEICE Transactions on Information and Sysmtes E89-D(2), 418–424 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, SC., Chen, TL., Hsu, CH. (2010). Message Clustering Technique towards Efficient Irregular Data Redistribution in Clusters and Grids. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-13119-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13118-9
Online ISBN: 978-3-642-13119-6
eBook Packages: Computer ScienceComputer Science (R0)