R. Lohner, M. Galle
A point renumbering scheme that halves the number of indirect addressing operations required for edge‐based field solvers has been developed. At the same time, an alternative (and entirely serendipitous) assembly of right‐hand side vectors was found to enhance performance considerably. The new loop structure is especially attractive for vector‐parallel machines with direct memory access. Timings on the CRAY‐SV1 and NEC‐SX5 show that for Laplacian loops, which appear in many CFD and CEM codes, CPU can be reduced considerably. The new renumbering scheme does not require any new data structures or arrays, allowing for progressive porting of loops in large‐scale production codes.
Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
Published on 01/01/2002
DOI: 10.1002/cnm.494Licence: CC BY-NC-SA license
Views 0Recommendations 0
Are you one of the authors of this document?