| Ziyad Hakura, Bill Elliot, and John Board. Parallel multipole treecode algorithm. Anonymous FTP: egr.duke.edu, Feb. 1994. |
....vectorized. The size of the data parallel prototype (which implements all 3 decompositions) is 477 executable lines of Proteus. The most compact C implementation with which we are familiar consists of just under 2000 executable statements, and this only implements the uniform spatial decomposition [12]. Developing the mathematical code for the 3D variants is extremely complex. Fortunately, at the intermediate steps in the development, it was simple to make comparisons with the direct (O(N 2 ) force calculations. By using a high level language in an interpretive environment, it is possible, ....
Ziyad Hakura, Bill Elliot, and John Board. Parallel multipole treecode algorithm. Anonymous FTP: egr.duke.edu, Feb. 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC