Abstract
The problem of mapping the parallel task to the nodes of computing cluster is considered. MPI software with non-uniform communication and heterogeneous interconnect of computing cluster could run faster using custom parallel processes mapping for optimization of data exchange. The graph mapping algorithm is developed. It uses parallel program representation as a task graph and cluster topology representation as system graph. The proposed optimization technique is tested on synthetic benchmark and on CORAL QBox software to study its efficiency on large number of computing cores. The positive results of optimization are achieved and the summary is presented in the paper.
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
References
Karlsson, C., Davies, T., Chen, Z.: Optimizing process-to-core mappings for application level multi-dimensional MPI communications. In: IEEE International Conference on Cluster Computing (CLUSTER 2012), pp. 486–494, 24–28 September 2012
Zhang, J., Zhai, J., Chen, W., Zheng, W.: Process mapping for MPI collective communications. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 81–92. Springer, Heidelberg (2009)
Chen, H., Chen, W., Huang, J., Robert, B., Kuhn, H.: MPIPP: an automatic profile-guided parallel process placement toolset for SMP clusters and multiclusters. In: Proceedings of the 20th Annual International Conference on Supercomputing, ICS 2006, pp. 353–360, June 2006
Intel\({}{\textregistered }\) Library Reference Manual (2014)
Gygi, F., Yates, R.K., Lorenz, J., Draeger, E.W., Franchetti, F., Ueberhuber, C., Supinski, B., Gunnels, S., Sexton, J.: Large-scale first-principles molecular dynamics simulations on the BlueGene platform using the Qbox code. In: Proceedings of the ACM/IEEE SC 2005, p. 24, 12–18 November 2005
Tornado SUSU Supercomputer (2014). http://supercomputer.susu.ac.ru/en/computers/tornado/
Sanyal, S., Jain, A., Das, S.K., Biswas, R.: A hierarchical and distributed approach for mapping large applications to heterogeneous grids using genetic algorithms. In: CLUSTER, pp. 496–499. IEEE Computer Society (2003)
Kafil, M., Ahmad, I.: Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency 6(3), 42–50 (1998)
Martin, R., Vahdat, A., Culler, D., Anderson, T.: Effects of communication latency, overhead, and bandwidth in a cluster architecture. In: Proceedings of the 24th Annual International Symposium on Computer Architecture (ISCA), pp. 85–97, June 1997. Graph with spatial structure like mesh
Bhatele, A., Kale, L.V.: Heuristic-based techniques for mapping irregular communication graphs to mesh topologies. In: 2011 IEEE 13th International Conference on High Performance Computing and Communications (HPCC), pp. 765–771, 2–4 September 2011
Eshaghian, M.M.: Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph. Int. J. Found. Comput. Sci. 12(05), 599–628 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Getmanskiy, V., Chalyshev, V., Kryzhanovsky, D., Lopatin, I., Leksikov, E. (2015). Optimizing Processes Mapping for Tasks with Non-uniform Data Exchange Run on Cluster with Different Interconnects. In: Kunkel, J., Ludwig, T. (eds) High Performance Computing. ISC High Performance 2015. Lecture Notes in Computer Science(), vol 9137. Springer, Cham. https://doi.org/10.1007/978-3-319-20119-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-20119-1_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20118-4
Online ISBN: 978-3-319-20119-1
eBook Packages: Computer ScienceComputer Science (R0)