James F. Leathrum. The Parallelization of the Fast Multipole Algorithm in Three Dimensions. PhD thesis, Duke University, 1992.  Home/Search   Document Not in Database   Summary   Related Articles

....10 GOLDBERG, MILLS, NYLAND, PRINS, REIF, AND RIELY and smaller cubic regions to represent the simulation space. It has phases that sweep sequentially up and then down the oct tree, with independent work for all the nodes at a given level. Many others have developed parallel solutions for the FMA [14, 30, 27], but none have explored adaptive parallelization for arbitrary non uniform distributions in 3D. The reason is extreme complexity of the mathematical, algorithmic, and data decomposition issues. In our work, we developed several prototypes of the 3D FMA using Proteus, to explore parallelism issues ....

James F. Leathrum. The Parallelization of the Fast Multipole Algorithm in Three Dimensions. PhD thesis, Duke University, 1992.

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