The connection machine: PDE solution on 65536 processors
From MaRDI portal
The paper gives a description of the connection machine (CM) computer, data about its hardware and programming language (COMMON LISP) and the difference from other parallel architectures. Further, implementations of the SOR relaxation algorithm, parallel multigrid and parallel preconditioned conjugated gradient algorithms are presented for solving partial differential equations of elliptical type. Results of numerical tests of the methods on CM are discussed.
Recommendations
- Solving PDEs on loosely-coupled parallel processors
- PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
- A multiprocessor architecture for solving nonlinear partial differential equations
- scientific article; zbMATH DE number 4155822
- THE PRECONDITIONED CONJUGATE GRADIENT METHOD ON THE CONNECTION MACHINE
- scientific article; zbMATH DE number 3907706
- Solution of Partial Differential Equations on Vector and Parallel Computers
- scientific article; zbMATH DE number 3924019
- The efficient parallel solution of PDEs
- SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES
Cited in
(5)- Special purpose computer for nonlinear differential equations
- Solving a 6120 -bit DLP on a Desktop Computer
- OPTIMIZATION OF CONNECTION MACHINE PERFORMANCE
- scientific article; zbMATH DE number 820528 (Why is no real title available?)
- scientific article; zbMATH DE number 1444443 (Why is no real title available?)
This page was built for publication: The connection machine: PDE solution on 65536 processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118366)