J. P. Singh
J. L. Hennessy
- 1.S.J. Aarseth, M. Henon, and R. Wielen. Astronomy and Astrophysics, 37, 1974.Google Scholar
- 2.Andrew A. Appel. An efficient program for many body simulation. SIAM Journal of Scient~c and Statistical Computing, 6:85-93, 1985.Google ScholarCross Ref
- 3.Joshua E. Barnes and Piet Hut. A hierarchical O(N log N) force calculation algorithm. Nature, 324(4):446--449, 1986.Google ScholarCross Ref
- 4.A. J. Chorin. Numerical study of slightly viscous flow. Journal of Fluid Mechanics, 57:785-796, 1973.Google ScholarCross Ref
- 5.Geoffrey C. Fox. Numerical Algorithms for Modern ParaUel Computer Architectures, chapter A Graphical Approach to Load Balancing and Sparse Matrix Vector Multiplication on the Hypercube, pages 37-62. Springer- Verlag, 1988.Google Scholar
- 6.Stephen R. Goldschmidt and Helen Davis. Tango introduction and tutorial. Technical Report CSL-TR-90-410, Stanford University, 1990. Google ScholarDigital Library
- 7.Leslie Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. ACM Press, 1987.Google Scholar
- 8.Leslie Greengard and William Gropp. Parallel Processing for Scientific Computing, chapter A Parallel Version of the Fast Multipole Method, pages 213-222. SIAM, 1987. Google ScholarDigital Library
- 9.Leslie Greengard and Vladimir Roldalin. A fast algorithm for particle simulation. Journal of Computational Physics, 73(325), 1987. Google ScholarDigital Library
- 10.P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. In Proceedings of SIGGRAPH, 1991. Google ScholarDigital Library
- 11.John L. Hennessy Jaswinder Pal Singh, Truman Joe and Anoop Gupta. An empirical comparison of the ksr-1 allcache and stanford dash multiprocessors. In Supercomputing '93, November 1993. Google ScholarDigital Library
- 12.Jacob Katzenelson. Computational structure of the N- body problem. SlAM Journal of Scientific and Statistical Computing, 10(4):787-815, 1989. Google ScholarDigital Library
- 13.Dan Lenoski, James Laudon, Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. The directory-based cache coherence protocol for the DASH multiprocessor. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 148-159, May 1990. Google ScholarDigital Library
- 14.John K. Salmon. Parallel Hierarchical N-body Methods. PhD thesis, California Institute of Technology, December 1990. Google ScholarDigital Library
- 15.Jaswinder Pal Singh. Parallel Hierarchical N-body Methods and their Implications for Multiprocessors. PhD thesis, Stanford University, February 1993.Google ScholarDigital Library
- 16.Jaswinder Pal Singh, Anoop Gupta, and John L. Hennessy. Implications of hierarchical N-body techniques for multiprocessor architecture. Submitted to A CM Transactions on Computer Systems. Early version available as Stanford Univeristy Tech. Report no. CSL-TR-92-506, January 1992. Google ScholarDigital Library
- 17.Jaswinder Pal Singh and John L. Hennessy. High Performance Computing I!, chapter Data Locality and Memory System Performance in the Parallel Simulation of Ocean Eddy Currents, pages 43-58. North-Holland, 1991. Also Stanford University Tech. Report No. CSL-TR-91-490.Google Scholar
- 18.Jaswinder Pal Singh, Chris Holt, Takashi Totsuka, Anoop Gupta, and John L. Hennessy. Load balancing and data locality in hierarchical N-body methods. Journal of Parallel and Distributed Computing. To appear. Preliminary version available as Stanford Univeristy Tech. Report no. CSL-TR-92-505, January 1992.Google Scholar
- 19.Feng Zhao. An O(n) algorithm for three-dimensional N- body simulations. Technical Report 995, MIT Artificial Intelligence Laboratory, 1987. Google ScholarDigital Library
Index Terms
- A parallel adaptive fast multipole method
Recommendations
A New Parallel Kernel-Independent Fast Multipole Method
SC '03: Proceedings of the 2003 ACM/IEEE conference on SupercomputingWe present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions does not rely on any analytic expansions, but only utilizes kernel ...
A parallel fast multipole method for elliptic difference equations
A new fast multipole formulation for solving elliptic difference equations on unbounded domains and its parallel implementation are presented. These difference equations can arise directly in the description of physical systems, e.g. crystal structures, ...
A Task Parallel Implementation of Fast Multipole Methods
SCC '12: Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and AnalysisThis paper describes a task parallel implementation of ExaFMM, an open source implementation of fast multipole methods (FMM), using a lightweight task parallel library MassiveThreads. Although there have been many attempts on parallelizing FMM, ...
Comments