Base-p-cyclic reduction for tridiagonal systems of equations
| Autor: | Pieter P. N. de Groen |
|---|---|
| Rok vydání: | 1991 |
| Předmět: |
Numerical Analysis
Hardware_MEMORYSTRUCTURES Tridiagonal matrix Applied Mathematics STRIDE Parallel computing ComputerSystemsOrganization_PROCESSORARCHITECTURES Base (topology) System of linear equations Vector processor Computational Mathematics Memory bank Algorithm Cyclic reduction Mathematics Diagonally dominant matrix |
| Zdroj: | Applied Numerical Mathematics. 8:117-125 |
| ISSN: | 0168-9274 |
| DOI: | 10.1016/0168-9274(91)90046-3 |
| Popis: | Cyclic reduction is often heralded as a vectorizable and fast method for the solution of weakly diagonally dominant tridiagonal systems of equations on a vector processor. However, in the standard version, where the number of equations is halved in each sweep (recursive doubling), sooner or later the algorithm runs into memory bank conflicts because the stride in the memory access is doubled in each sweep and eventually becomes a multiple of the number of memory banks. In this note we consider variants of the algorithm, in which the stride is tripled after each sweep and/or the reduced system of equations is moved to contoguous locations beyond the original ones. We shall compare performances on CRAY X-MP and NEC SX-2 machines. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|