Parallelism in multigrid methods: How much is too much?

International Journal of Parallel Programming

Volumn 24, Issue 5, 1996, Pages 397-432

  Matheson, Lesley R ^a   Tarjan, Robert E ^a,b  

^a NEC LABORATORIES AMERICA   (United States)

^b Princeton University   (United States)

Author keywords

Models of parallel computation; Parallel computers; Parallel multigrid methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE DIFFERENCE METHOD; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; MATHEMATICAL MODELS; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

CHAN TUMINARO ALGORITHM; F CYCLE ALGORITHMS; GANNON VAN ROSENDALE ALGORITHM; MULTIGRID METHODS; MULTIPLE COARSE GRID ALGORITHM; SINGLE INSTRUCTION MULTIPLE DATA (SIMD) FINE GRAIN COMPUTERS; V CYCLE ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0030257515     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02583022     Document Type: Article

References (38)

1. R. Fedorenko, Relaksacionnyi Metod Resenija Raznostynch Ellipticeskich Uravenija, CISL Matern i Matern Fi:, 1:922-927 (1961).
2. L. Matheson, Multigrid Algorithms on Massively Parallel Computers, Ph.D. Dissertation, Department of Computer Science, Princeton University (1994).
3. L. Matheson and R. Tarjan, Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications, Journal of Parallel and Distributed Computing, 33:33-43(1996).
4. W. Briggs, A Multigrid Tutorial, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania (1987).
5. D. Jespersen, Multigrid Methods for Partial Differential Equations, Studies in Numerical Analysis, E. Golub, pp. 270-318 (1984).
6. W. Hackbush, Multi-Grid Methods and Applications, Springer-Verlag, Berlin, Germany (1985).
7. G. Forsythe and W. Wasow, Finite Difference Methods for Partial Differential Equations, John Wiley and Sons, New York (1960).
8. C. Desai, Elliptic Finite Element Methods, Prentice-Hall, Englewood Cliffs, New Jersey (1979).
9. J. Botha and G. Finder, Fundamental Concepts in the Numercial Solution of Differential Equations, John Wiley and Sons, New York (1963).
10. P. Fredrickson and O. McBryan, Parallel Superconvergent Multigrid. In: Proc. 3rd Copper Mountain Conf. on Multigrid Methods, S. McCormick (ed.), Marcel Dekker, New York, pp. 195-210 (1987).
11. T. Chan and R. Tuminaro, Design and Implementation of Parallel Multigrid Algorithms. In: Proc. of the 3rd Copper Mountain Conf. on Multigrid Methods, S. McCormick (ed.), Marcel Dekker, New York, pp. 101-115 (1987).
12. R. Tuminaro, Multigrid Algorithms on Parallel Processing Systems, Ph.D. Dissertation, Department of Computer Science, Stanford University (1989).
13. T. Chan and R. Tuminaro, Analysis of a Parallel Multigrid Algorithm. In: Proc. of the 4th Copper Mountain Conf. on Multigrid Methods, S. McCormick (ed.), Marcel Dekker, New York, pp. 69-86 (1989).
14. D. Gannon and J. van Rosendale, On the Structure of Parallelism in a Highly Concurrent PDE Solver, Journal of Parallel and Distributed Computing, 3:106-135 (1986).
15. J. Jaja, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, Massachusetts (1992).
16. L. Snyder, Type Architectures, Shared Memory and the Corollary of Modest Potential, Ann. Review of Computer Science, Annual Review, Inc., pp. 289-318 (1986).
17. W. Hightower, J. Prins, and J. Reif, Implementations of Randomized Sorting Algorithms on Large Parallel Machines, Proc. 4th Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 158-167 (1992).
18. G. Blelloch, C. Leiserson, B. Maggs, G. Plaxton, S. Smith and M. Zagha, A Comparison of Sorting Algorithms for the Connection Machine CM-2, Proc. of the 3rd Ann. ACM Synip. on Parallel Algorithms and Architectures, pp. 3-16 (1991).
19. T. Leighton, Introduction to Parallel Architectures: Arrays, Trees, Hyperaibes, Morgan-Kaufmann, San Mateo, California (1992).
20. L. Valiant, A Bridging Model for Parallel Computation, Comm. of the ACM, 33:103-111 (1990).
21. Technical Summary, The MasPar MPI System, MasPar Computer Corporation, Sunnyvale, California (1992).
22. The Connection Machine CM-200 Series, Technical Summary, Thinking Machines Corporation, Cambridge, Massachusetts (1992).
23. J. McDonnell, Private Communication, MasPar Computer Corporation (1992).
24. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos and T. von Eicken, LogP: Towards a Realistic Model of Parallel Computation, Proc. of the ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming and ACM SIGPLAN Notices, 28:1-12(1993).
25. B. Maggs, L. Matheson and R. Tarjan, Models of Parallel Computation: A Survey and Synthesis, Proc. 28th Hawaii Int. Conf. on Syst. Sei., IEEE Computer Society Press, 2:61-70 (1995).
26. Z. Bozkus, S. Ranka and G. Fox, Benchmarking the CM-5 Multicomputer, Proc. of the 4til Symp. on the Frontiers of Massively Parallel Computation, pp. 100-107 (1992).
27. R. Ponnusamy, A. Choudhary and G. Fox, Communications on the CM-5: An Experimental Performance Evaluation, Proc. of the 4th Symp. on the Frontiers of Massirely Parallel Computation, pp. 108-117 (1992).
28. Pablo Tomayo, Private Communication, Thinking Machines Inc. (1992).
29. L. Martinelli, Private Communication, Department of Mechanical and Aerospace Engineering, Princeton University, 1994.
30. K. Stuban and U. Trottenberg, Multigrid Methods: Fundamental Algorithms, Model Problem Analysis and Applications. In: Multigrid Methods, Proceedings of the Koln-Por: Conference, W. Hackbusch and U. Trottenberg (eds.), Lecture Notes in Mathematics 960, Springer-Verlag, Berlin, Germany, pp. 1-176 (1982).
31. P. Fredrickson and O. McBryan, Normalized Convergence Rates for the PSMG Method, SIAM Journal of Scientific and Statistical Computing, 12:221-229 (1991).
32. N. Naik, Timely Communications: A Note on the Parallel Efficiency of the FredricksonMcBryan Algorithm, SI A M Journal of Scientific and Statistical Computing, 12:208-220 (1991).
33. C. Douglas and W. Miranker, Constructive Interference in Parallel Algorithms, SIAM Journal of Nwnercial Analysis, 25:376-398 (1988).
34. J; Dendy, Private Communication, Los Alamos National Laboratory (1993).
35. R. Tuminaro and D. Womble, Analysis of the FMV Cycle for Massively Parallel Machines (abstract), Proc. Fifth Copper Mountain Conf. on Multigrid Methods, Vol. 1 (1991).
36. J. Dendy, M. Ida and J. Rutledge, A Semi-Coarsening Multigrid Algorithm for SIMD Machines, SIAM J. Sei. Slat. Compta. 13:1460-1469 (1992).
37. N. Naik and J. van Rosendale, The Improved Robustness of Multigrid Elliptic Solvers Based on Multiple Semi-Coarsened Grids, SIAM Journal of Nwnercial Analysis 30:215-229 (1993).
38. M. Greibel, Parallel Domain-Oriented Multilevel Methods, SIAM Journal on Scientic Computing, 9:1105-1125 (1995).