In our first write-up, we introduced our initial Barnes-Hut design. There, we describe the framework and mention many of the interesting issues. For the remainder of the semester, we would like to investigate and implement the following:
Firstly, we would like to explore the relationship between software caching and execution speed. We will add software caching of node information to our implementation. We will then measure the speedup from the caching for both the tree-build and the tree-walk phases. We will also measure the additional memory required by the caching implementation.
Secondly, we would like to implement a second parallel tree-build algorithm. This algorithm could then be used to make fair comparisons to our existing parallel tree-build, and would additionally act as a testbed for the above caching strategies.
-----maintained by <email@example.com>