Abstract
In this article, we present a multigrid algorithm for parallel computers, the chopped parallel multigrid (CPMG) algorithm. The CPMG algorithm improves the processor utilization by reducing the work load on coarse grids without affecting the convergence rate of the algorithm. This is in contrast to earlier approaches (Gannon and van Rosendale, 1986; Frederickson and McBryan, 1989), where unutilized processors are used to improve the convergence rate. The CPMG algorithm reduces the coarse grid work bychopping the alternate cycles of multigrid. Using analytical results and simulations on sequential machines we show that the CPMG can achieve almost the same convergence rate as standard MG for many cases. Analytically we show that the advantage gained by CPMG over standard MG on a mesh connected massively parallel machine is 33% in hardware utilization, 50% in communication overheads and 38% in overall execution time. We have also evaluated the performance of CPMG on an actual massively parallel machine, the DAP-510. The advantage gained by CPMG over standard MG is 35% in overall execution time. Moreover, the CPMG can be integrated with other parallel multigrid algorithms, such as the PSMG algorithm (Frederickson and McBryan, 1989) and Decker's algorithm (Decker, 1990).
Similar content being viewed by others
References
Brandt, A. (1977). Multilevel adaptive solutions to boundary value problems,Math. Comput. 31, 333–390.
Briggs, W. (1987).A Multigrid Tutorial, Society for Industrial and Applied Mathematics, Philadelphia.
Chan, T., and Saad, Y. (1986). Multigrid algorithms on the hypercube multiprocessors,IEEE Trans. Comput. C-35(11), 969–977.
Decker, N. H. (1990). On the parallel efficiency of the Fredrickson-McBryan multigrid, ICASE Report No. 90-17, Institute for Computer Applications in Science and Engineering, Hampton, Virginia.
Frederickson, P., and McBryan, O. (1989). Parallel superconvergent multigrid,Proceedings of the Third Copper Mountain Conference on Multigrid Methods, McCormick, S. (ed., Marcel Dekker, New York.
Gannon, D., and van Rosendale, J. (1986). On the structure of parallelism in a highly concurrent PDE solver,J. Parallel Distributed Comput. 3, 106–135.
Grosch, C. E. (1979). Performance analysis of Poisson solvers on array computers,Super-computers, Vol. 2, Jesshope, C. R., and Hockney, R. W. (eds.), Infotech Intl., pp. 147–181.
Hackbusch, W., and Totenberg, U. (1982).Multigrid Methods, Springer-Verlag, Berlin.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gupta, S.N., Zubair, M. & Grosch, C.E. A multigrid algorithm for parallel computers: CPMG. J Sci Comput 7, 263–279 (1992). https://doi.org/10.1007/BF01061331
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01061331