Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Barnes-Hut"”.
-
Dynamic Parallelism in GPU Optimized Barnes Hut Trees for Molecular Dynamics Simulations
Since the beginning of the modern computing era, high performance computing has been pushing the boundaries of the types of problems that can be solved in many different disciplines. One of the leading fields is computational biophysics where molecular dynamics (MD) simulations provide microscopic …
-
Optimizing Barnes-Hut simulations for many-core super computers using the scalable parallel runtime
… In this paper, we investigate optimizing the Barnes-Hut simulation by using the PPL Runtime which we implement using SPR. PPL provides a PGAS runtime with one-sided com- munication facilities, ideal for irregular applications with dynamic commu- nication patterns like that of Barnes-Hut.
-
Distribution-independent hierarchical N-body methods
… Widely respected among these are the Barnes-Hut and Greengard methods. Greengard claims his algorithm reduces the complexity to O(N) time per iteration;Throughout this thesis, we concentrate on rigorous, distribution-independent, worst-case analysis of the N-body methods. We show that …
-
An object-oriented library for shared-memory parallel simulations
… MP3D (particle-based wind tunnel simulation), Barnes-Hut (n-body gravitation simulation) and Water (water molecule simulation). MP3D only needs local synchronization, and uses distributed synchronization: barriers are replaced by synchronization on local clocks in regions of space. Early …
-
Dynamic multilevel graph layout and visualisation
… between groups of vertices much like the Barnes Hut Octree. The method suggests better representation of the graphs underlying relationships. In experiments this algorithm, referred to as Multilevel Global Force (MGF), reduces running time by an average of 40% compared to the popular …
-
Increasing performance in Force Directed Graphs: an application in cancer support service provision profiling
… usage of the program. This took the form of the Barnes-Hut algorithm which was used to approximate the Node-to-Node physics calculations in the graph as well as a conversion to using a GPU Compute Shader to improve the speed of the Edge Physics Calculations. A range of options to filter the data …
-
Automatic data aggregation for software distributed shared memory systems
… used a test suite of four applications--3D-FFT, Barnes-Hut, Ilink and Shallow. For these applications we obtained 40% to 66% reduction in message counts which resulted in 6% to 19% improvement in execution times.
-
Automatically Optimizing Tree Traversal Algorithms
… domains, namely, tree traversal algorithms like Barnes-Hut, nearest neighbor and ray tracing, there exist general techniques to enhance performance. We investigate two sources of performance improvement: locality enhancement and vectorization. Furthermore we demonstrate that these techniques can …
-
Incompleteness + interoperability: a multi-paradigm approach to parallel programming for science and engineering applications
… performance. We will demonstrate this through a Barnes-Hut application that is composed from pieces of code written in Charisma, DivCon, Distree and Charm++.