Traversal Caches: A Framework for FPGA Acceleration of Pointer Data Structures

Algorithm 1

Pseudocode of software Barnes-Hut implementation.

def BarnesHut (TimeSteps, Bodies, theta):

 for # of TimeSteps:

  Tree = BuildTree (Bodies)

  for each body 𝑏_𝑖 in Bodies:

   force = CalculateForce (𝑏_𝑖, Tree, theta)

   𝑏_𝑖 = UpdateState (force, 𝑏_𝑖)

  Bodies = (𝑏₀, 𝑏_𝑖,…, 𝑏_𝑁)

 return Bodies