Brief announcement: Towards a communication optimal Fast Multipole Method and its implications at exascale

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2012, Pages 182-184

  Chandramowlishwaran, Aparna ^a   Choi, Jee Whan ^a   Madduri, Kamesh ^b   Vuduc, Richard ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Cache complexity analysis; Exascale; Fast Multipole Method; Performance modeling

Indexed keywords

ANALYTICAL PERFORMANCE MODEL; APPROXIMATION ACCURACY; ASYMPTOTICALLY LINEAR; CACHE COMPLEXITY; EXASCALE; FAST MULTIPLE METHOD; FAST MULTIPOLE METHOD; LOWER BOUNDS; MEMORY COST; ON CURRENTS; PARTICLE SYSTEMS; PERFORMANCE MODEL; PERFORMANCE MODELING; SYSTEM CONFIGURATIONS; TUNING PARAMETER;

OPTIMIZATION;

ALGORITHMS;

EID: 84864128713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2312005.2312039     Document Type: Conference Paper

References (11)

1. G. E. Blelloch, R. A. Chowdhury, P. B. Gibbons, V. Ramachandran, S. Chen, and M. Kozuch. Provably good multicore cache performance for divide-and-conquer algorithms. In Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), pages 501-510, Philadelphia, PA, USA, 2008. SIAM.
2. G. E. Blelloch, P. B. Gibbons, and H. V. Simhadri. Low depth cache-oblivious algorithms. In Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA), Thira, Santorini, Greece, July 2010.
3. J. Board and K. Schulten. The fast multipole algorithm. Computing in Science and Engineering, 2(1):76-79, January/February 2000.
4. A. Chandramowlishwaran, K. Madduri, and R. Vuduc. Diagnosis, tuning, and redesign for multicore performance: A case study of the Fast Multipole Method. In Proc. ACM/IEEE Conf. Supercomputing (SC), New Orleans, LA, USA, November 2010.
5. A. Chandramowlishwaran, S. Williams, L. Oliker, I. Lashuk, G. Biros, and R. Vuduc. Optimizing and tuning the Fast Multipole Method for state-of-the-art multicore architectures. In Proc. IEEE Int'l. Parallel and Distributed Processing Symp. (IPDPS), Atlanta, GA, USA, April 2010.
6. L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. J. Comp. Phys., 73:325-348, 1987.
7. I. Lashuk, A. Chandramowlishwaran, H. Langston, T.-A. Nguyen, R. Sampath, A. Shringarpure, R. Vuduc, L. Ying, D. Zorin, and G. Biros. A massively parallel adaptive Fast Multipole Method on heterogeneous architectures. In Proc. ACM/IEEE Conf. Supercomputing (SC), Portland, OR, USA, November 2009.
8. R. Lipton and R. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2), 1979.
9. A. Rahimian, I. Lashuk, D. Malhotra, A. Chandramowlishwaran, L. Moon, R. Sampath, A. Shringarpure, S. Veerapaneni, J. Vetter, R. Vuduc, D. Zorin, and G. Biros. Petascale direct numerical simulation of blood flow on 200k cores and heterogeneous architectures. In Proc. ACM/IEEE Conf. Supercomputing (SC), New Orleans, LA, USA, November 2010.
10. R. Vuduc and K. Czechowski. What GPU computing means for high-end systems. IEEE Micro, 31(4):74-78, July/August 2011.
11. L. Ying, D. Zorin, and G. Biros. A kernel-independent adaptive Fast Multipole Method in two and three dimensions. J. Comp. Phys., 196:591-626, May 2004. (Pubitemid 38613258)