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
Parallelisation and Performance Analysis of a TreeSPH Code for Galaxy Simulations
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Numerical Analysis, NA.
2014 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Parallellisering och prestandaanalys av en TreeSPH-kod för galaxsimuleringar (Swedish)
Abstract [en]

In cosmological simulations, the Lagrangian method Smoothed Particle Hydrodynamics is often applied to cover gas dynamics and combined with tree algorithms for long-range potentials like the Barnes-Hut method to include self-gravity and derive the nearest neighbour lists efficiently. In this thesis, a so-called TreeSPH code is parallelized by using MPI and subsequently the performance is analysed. For the domain decomposition to the processes, the structure of an octree is examined and space filling curves are applied to achieve well-working dynamical load balancing. For an efficient parallel SPH calculation, a novel method with a localised boundary handling is proposed to reduce communication overhead

Abstract [sv]

Inom kosmologiska simulationer är den Lagrangianska metoden Smoothed Particle Hydrodynamics en vanligt förekommande metod för att täcka gasdynamik och kombineras med trädalgortimer för långdistanspotentialer, exempelvis Barnes-Huts metod för att inkludera självgravitation och effektivt konstruera listor med de närmaste grannarna. I detta examensarbete parallelliseras en så kallad TreeSPH-kod med hjälp av MPI, därefter analyseras prestandan. Gällande domändekomposition av processerna så undersöks strukturen av en octree där rymdfyllande kurvor appliceras för att uppnå en väl fungerande dynamisk lastbalansering. För en effektiv parallell SPH beräkning föreslås en ny metod med lokal randbehandling för att reducera kommunikation.

Place, publisher, year, edition, pages
2014.
Series
TRITA-MAT-E, 2014:39
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-147340OAI: oai:DiVA.org:kth-147340DiVA: diva2:729499
Subject / course
Scientific Computing
Educational program
Master of Science - Scientific Computing
Supervisors
Examiners
Available from: 2014-06-26 Created: 2014-06-26 Last updated: 2014-06-26Bibliographically approved

Open Access in DiVA

fulltext(1691 kB)286 downloads
File information
File name FULLTEXT01.pdfFile size 1691 kBChecksum SHA-512
65ca88ced4f8412838eb0cc41473ecab1aed082699df879ce15b0b3fec6c30c8a57df46dcf6590683edabeff93621a108064e10719419622a99dd29a4d20b5ee
Type fulltextMimetype application/pdf

By organisation
Numerical Analysis, NA
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 286 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: 400 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