Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Preconditioned Iterative Linear Solvers for Unstructured Grids on the Earth Simulator
HPCASIA '04 Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference
HPCASIA '04 Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference
Scientific Computations on Modern Parallel Vector Systems
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Communication Bandwidth of Parallel Programming Models on Hybrid Architectures
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
| Hi-index | 0.00 |
Parallel iterative linear solvers for unstructured grids in FEM application, which were developed for the Earth Simulator (ES), have been ported to various types of SMP cluster supercomputers. Performance of flat-MPI and hybrid parallel programming model has been compared using more than 100 SMP nodes of ES, Hitachi SR8000 and IBM SP-3. Effect of coloring and method for storage of coefficient matrices have been also evaluated in various types of applications. Generally speaking, codes, which are developed for vector processors using multicolor ordering, demonstrate better performance with many colors on scalar processors. Flat-MPI and hybrid are competitive for each supercomputer. On ES, hybrid outperforms flat-MPI when number of SMP node is large and problem size is small because of MPI latency. In parallel computation of FEM-type applications, MPI latency is a very important parameter for choosing flat-MPI or hybrid.