The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The scalability and efficiency of graph applications are significantly constrained by conventional systems and their supporting programming models. Technology trends like multicore, manycore, and heterogeneous system architectures are introducing further challenges and possibilities for emerging application domains such as graph applications. This paper explores the space of effective parallel execution of ephemeral graphs that are dynamically generated using the Barnes-Hut algorithm toarXiv:1109.5190v1 fatcat:ashsmlawhbbglfif4ykcu5vc3q