Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Implementation, performance analysis and optimization of a molecular dynamics tree algorithm for large-scale cluster systems
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA. (Numeriska analys)
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Molecular Dynamics has been a field using the most advanced computer systems for decades to perform simulations. Sophisticated methods with complicated potentials and parallelized implementations have been developed starting from simple models and a few hundred atoms within one simulation in the beginning. Nowadays, we see an increasing need for large-scale parallel simulations in molecular dynamics. Computer simulations are a cost-effective research tool.

Furthermore, a shift to multi-core processors provides computer systems allowing a much higher degree of parallelism in applications. It is possible to use implementations on these systems, which are based on established programming models and techniques. Nevertheless, it is necessary to analyze the limitations of such implementations on significant larger systems then common until now. Such an analysis work is an important step to the development of new programming models that make efficient use of modern multi-core processors.

This thesis project has been focused on the implementation and performance analysis of a tree code that is an important algorithm for molecular dynamic simulations. The tree code algorithm has been parallelized for distributed memory computer systems using MPI. The load-balancing applies space-filling curves for work decomposition. The performance of the implementation was tested finally with input data covering a large range of parameters like the number of processors in the jobs and the number of particles per processor.

Place, publisher, year, edition, pages
2012. , 77 p.
Series
TRITA-MAT-E, 2012:10
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-106264OAI: oai:DiVA.org:kth-106264DiVA: diva2:573582
Subject / course
Scientific Computing
Educational program
Master of Science - Computer Simulation for Science and Engineering
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2012-12-02 Created: 2012-12-02 Last updated: 2013-05-25Bibliographically approved

Open Access in DiVA

fulltext(2159 kB)208 downloads
File information
File name FULLTEXT02.pdfFile size 2159 kBChecksum SHA-512
dd5193fb59876f26dc2e7b4b4bfb4d759df633cbf29f8700f564d6607b7571664ebedf7e4b3e585080edbfe316831523ce6179061d99713703c4aa5475fd378b
Type fulltextMimetype application/pdf

By organisation
Numerical Analysis, NA
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 226 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 373 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf