000857997 001__ 857997
000857997 005__ 20220930130202.0
000857997 0247_ $$2URN$$a    urn:nbn:de:bsz:14-qucosa2-314122
000857997 0247_ $$2URN$$aurn:nbn:de:bsz:14-qucosa2-314122
000857997 0247_ $$2Handle$$a2128/20273
000857997 037__ $$aFZJ-2018-06944
000857997 041__ $$aEnglish
000857997 1001_ $$0P:(DE-Juel1)161429$$aHaensel, David$$b0$$eCorresponding author$$ufzj
000857997 245__ $$aA C++ based MPI-enabled Tasking Framework to Efficiently Parallelize Fast Multipole Methods for Molecular Dynamics$$f2014-12-01 - 2018-02-28
000857997 260__ $$c2018
000857997 300__ $$axiii, 121
000857997 3367_ $$2DataCite$$aOutput Types/Dissertation
000857997 3367_ $$2ORCID$$aDISSERTATION
000857997 3367_ $$2BibTeX$$aPHDTHESIS
000857997 3367_ $$02$$2EndNote$$aThesis
000857997 3367_ $$0PUB:(DE-HGF)11$$2PUB:(DE-HGF)$$aDissertation / PhD Thesis$$bphd$$mphd$$s1543839567_8687
000857997 3367_ $$2DRIVER$$adoctoralThesis
000857997 502__ $$aDissertation, TU Dresden, 2018$$bDissertation$$cTU Dresden$$d2018$$o2018-07-02
000857997 520__ $$aToday’s supercomputers gain their performance through a rapidly increasingnumber of cores per node. To tackle issues arising from those developmentsnew parallelization approaches guided by modern software engineering are in-evitable. The concept of task-based parallelization is a promising candidate toovercome many of those challenges. However, for latency-critical applications,like molecular dynamics, available tasking frameworks introduce considerableoverheads. In this work a lightweight task engine for latency-critical applica-tions is proposed. The main contributions of this thesis are a static data-flowdispatcher, a type-driven priority scheduler and an extension for communication-enabled tasks. The dispatcher allows a user-configurable mapping of algorithmicdependencies in the task-engine at compile-time. Resolving these dependenciesat compile-time reduces the run-time overhead. The scheduler enables the pri-oritized execution of a critical path of an algorithm. Additionally, the prioritiesare deduced from the task type at compile-time as well. Furthermore, the afore-mentioned task engine supports inter-node communication via message passing.The provided communication interface drastically simplifies the user interface ofinter-node communication without introducing additional performance penalties.Thisisonlypossiblebydistinguishingtwodeveloperroles–thelibrarydeveloperand the algorithm developer. All proposed components follow a strict guideline toincrease the maintainability for library developers and the usability for algorithmdevelopers. To reach this goal a high level of abstraction and encapsulation isrequired in the software stack. As proof of concept the communication-enabledtask engine is utilized to parallelize the FMM for molecular dynamics.
000857997 536__ $$0G:(DE-HGF)POF3-511$$a511 - Computational Science and Mathematical Methods (POF3-511)$$cPOF3-511$$fPOF III$$x0
000857997 536__ $$0G:(DE-Juel1)PHD-NO-GRANT-20170405$$aPhD no Grant - Doktorand ohne besondere Förderung (PHD-NO-GRANT-20170405)$$cPHD-NO-GRANT-20170405$$x1
000857997 8564_ $$uhttps://juser.fz-juelich.de/record/857997/files/Thesis_David_Haensel.pdf$$yOpenAccess
000857997 8564_ $$uhttps://juser.fz-juelich.de/record/857997/files/Thesis_David_Haensel.pdf?subformat=pdfa$$xpdfa$$yOpenAccess
000857997 909CO $$ooai:juser.fz-juelich.de:857997$$pVDB$$pdriver$$purn$$popen_access$$popenaire$$pdnbdelivery
000857997 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)161429$$aForschungszentrum Jülich$$b0$$kFZJ
000857997 9131_ $$0G:(DE-HGF)POF3-511$$1G:(DE-HGF)POF3-510$$2G:(DE-HGF)POF3-500$$3G:(DE-HGF)POF3$$4G:(DE-HGF)POF$$aDE-HGF$$bKey Technologies$$lSupercomputing & Big Data$$vComputational Science and Mathematical Methods$$x0
000857997 9141_ $$y2018
000857997 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
000857997 920__ $$lyes
000857997 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
000857997 980__ $$aphd
000857997 980__ $$aVDB
000857997 980__ $$aUNRESTRICTED
000857997 980__ $$aI:(DE-Juel1)JSC-20090406
000857997 9801_ $$aFullTexts