×

Communication performance of \(d\)-meshes in molecular dynamics simulation. (English) Zbl 1187.92090

Summary: Communication algorithms, tailored for molecular dynamics simulation on \(d\)-meshes, are evaluated in terms of communication efficiency. It has been shown elsewhere that \(d\)-meshes are better than other regular topologies, e.g., hypercubes and standard toroidal 4-meshes, when compared in their diameter and average distance among nodes. Collective communication is needed in molecular dynamics simulation for the distribution of coordinates and calculation and distribution of new energies. We show that both collective communication patterns used in molecular dynamics can be efficiently solved with congestion-free algorithms for all-to-all communication based on store-and-forward routing and routing tables. Our results indicate that \(d\)-meshes compete with hypercubes in parallel computers. Therefore \(d\)-meshes can also be used as a communication upgrade of existing molecular dynamics simulation platforms and can be successfully applied to perform fast molecular dynamics simulation.

MSC:

92E10 Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
68U20 Simulation (MSC2010)
92E99 Chemistry
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Janežič D.: Cell. Mol. Biol. Lett. 7, 78 (2002)
[2] Spichak V.: Annali Di Geofisica 44, 273 (2001)
[3] Hren R.: Phys. Med. Biol. 43, 1449 (1998) · doi:10.1088/0031-9155/43/6/006
[4] Trunk P., Gersak B., Trobec R.: Comput. Biol. Med, 33, 203 (2003) · doi:10.1016/S0010-4825(02)00087-2
[5] Golub G., Ortega J.M.: Scientific Computing, an Introduction with Parallel Computing. Academic Press, Inc., San Diego (1993) · Zbl 0790.65001
[6] Borštnik U., Hodošček M., Janežič D.: J. Chem. Inf. Comput. Sci. 44, 359 (2004)
[7] Trobec R., Šterk M., Praprotnik M., Janežič D.: Int. J. Quant. Chem. 96, 530 (2004) · doi:10.1002/qua.10742
[8] Adiga N.R. et al.: IBM J. Research Devel 49, 265 (2005) · Zbl 05420169 · doi:10.1147/rd.492.0265
[9] Kumar V., Grama A., Gupta A., Karypis G.: Introduction to Parallel Computing – Design and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Inc., Redmond City (1994) · Zbl 0861.68040
[10] Aronson L.D.: Networks and Routing–A Survey. Faculteit der Technische Wiskunde en Informatica, Delft (1994) · Zbl 0803.34026
[11] Jerebic I., Trobec R.: Information Processing Letters 43, 285–291 (1992) · Zbl 0769.68046 · doi:10.1016/0020-0190(92)90113-A
[12] Y. Yang, J. Wang, in Proceedings of 5th IEEE International Symposium on High-Performance Computer Architecture (HPCA- 5) (IEEE, Orlando, FL, 1999), pp. 290–299
[13] Trobec R.: Parallel Computing 26, 1945 (2000) · Zbl 0948.68080 · doi:10.1016/S0167-8191(00)00063-6
[14] Heerman D., Burkitt A.: Parallel Algorithms in Computational Science. Springer-Verlag, Berlin (1991)
[15] Trobec R., Jerebic I., Janežič D.: Parallel Computing 19, 1029 (1993) · Zbl 00440354 · doi:10.1016/0167-8191(93)90095-3
[16] Janežič D., Praprotnik M., Merzel F.: J. Chem. Phys. 122, 174101 (2005) · doi:10.1063/1.1884607
[17] Brooks B.R., Hodošček M.: Chem. Design Automat. News. 7, 16 (1992)
[18] Borštnik U., Hodošček M., Janežič D.: Croat. Chem. Acta 78, 211 (2005)
[19] Diestel, Graph Theory, (Springer-Verlag, New York, 2000)
[20] U. Jovanovič, R. Trobec, in: Parallel Numerics ’02, eds. R.Trobec, P. Zinterhof, M. Vajteric, A. Uhl, (University of Salzburg & Jozef Stefan Institute, Salzburg, Ljubljana, 2002) pp. 109–121
[21] K. Kutnar, U. Borštnik, D. Marušič, D. Janežič, J. Math. Chem. doi: 10.1007/s10910-008-9412-5
[22] Vizitiu A.E., Diudea M.V., Nikolić S., Janežič D.: J. Chem. Inf. Model. 46, 2574 (2006) · doi:10.1021/ci600191b
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.