SCALLOP: A highly scalable parallel poisson solver in three dimensions

Proceedings of the 2003 ACM/IEEE Conference on Supercomputing, SC 2003

Volumn , Issue , 2003, Pages

  Balls, Gregory T ^a   Baden, Scott B ^a   Colella, Phillip ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

computation intensive applications; parallel and distributed algorithms; program optimization and performance programming

Indexed keywords

COMMUNICATION COST; COMMUNICATION OVERHEADS; ELLIPTIC PARTIAL DIFFERENTIAL EQUATION; INFINITE DOMAINS; PARALLEL AND DISTRIBUTED ALGORITHMS; PROGRAM OPTIMIZATION; PROGRAMMING SYSTEM; THREE DIMENSIONS;

ALGORITHMS; BOUNDARY CONDITIONS; COMMUNICATION; MOLLUSCS; PARALLEL PROCESSING SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS;

SHELLFISH;

EID: 84877060202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1048935.1050174     Document Type: Conference Paper

References (18)

1. C. R. Anderson. A method of local corrections for computing the velocity field due to a distribution of vortex blobs. Journal of Computational Physics, 62:111-123, 1986.
2. S. B. Baden and S. J. Fink. Communication overlap in multi-tier parallel algorithms. In Proc. of SC '98, Orlando, Florida, November 1998.
3. S. B. Baden and S. J. Fink. A programming methodology for dual-tier multicomputers. IEEE Trans. Software Engineering, 26(3):212-26, March 2000.
4. S. B. Baden and D. Shalit. Performance tradeoffs in multi-tier formulation of a finite difference method. In Proc. 2001 International Conference on Computational Science, San Francisco, CA, May 2001.
5. G. T. Balls. A Finite Difference Domain Decomposition Method Using Local Corrections for the Solution of Poisson's Equation. PhD thesis, University of California, Berkeley, 1999.
6. G. T. Balls and P. Colella. A finite difference domain decomposition method using local corrections for the solution of Poisson's equation. Journal of Computational Physics, 180(1):25-53, July 2002.
7. R. Bank and M. Holst. A new paradigm for parallel adaptive meshing algorithms. SIAM Journal on Scientific Computing, 22(4):1411-1443, 2000.
8. M. J. Berger and P. Colella. Local adaptive mesh refinement for shock hydrodynamics. Journal of Computational Physics, 82:64-84, 1989.
9. W. L. Briggs. A Multigrid Tutorial. SIAM, 1987.
10. S. J. Fink, S. R. Kohn, and S. B. Baden. Efficient run-time support for irregular block-structured applications. Journal of Parallel and Distributed Computing, 50(1-2):61-82, April-May 1998.
11. M. Frigo and S. G. Johnson. FFTW: An adaptive software architecture for the FFT. In ICASSP Conference Proceedings, volume 3, pages 1381-1384. ICASSP, 1998.
12. L. Greengard and V. Rokhlin. A fast algorithm for particle simulations. The Journal of Computational Physics, 73:325-348, 1987.
13. M. Holst. Applications of domain decomposition and partition of unity methods in physics and geometry. In I. Herrera, D. E. Keyes, O. B. Widlund, and R. Yates, editors, Proceedings of the Fourteenth International Conference on Domain Decomposition Methods, January 2002.
14. R. A. James. The solution of Poisson's equation for isolated source distributions. Journal of Computational Physics, 25(2):71-93, October 1977.
15. K. Lackner. Computation of ideal MHD equilibria. Computer Physics Communications, 12(1):33-44, 1976.
16. B. F. Smith and O. B. Widlund. A domain decomposition algorithm using a heirarchical basis. SIAM Journal on Scientific and Statistical Computing, 11(6):1212-1220, November 1990.
17. A. Sohn and R. Biswas. Communication studies of DMP and SMP machines. Technical Report NAS-97-004, NAS, 1997.
18. A. K. Somani and A. M. Sansano. Minimizing overhead in parallel algorithms through overlapping communication/computation. Technical Report 97-8, ICASE, February 1997.