(Replaced content with "==Abstract== Several possibilities for the reduction of indirect addressing operations within edge-based solvers are discussed. It is shown that indirect addressing opera...") |
m (Cinmemj moved page Draft Samper 629145484 to Lohner 1994a) |
(No difference)
| |
Latest revision as of 09:33, 9 July 2020
Abstract
Several possibilities for the reduction of indirect addressing operations within edge-based solvers are discussed. It is shown that indirect addressing operations may be reduced by a factor in excess of 1 : 4 if edges are grouped and linked together. Tests of benchmark loops on two common engineering computer platforms reveal that CPU saving factors ranging from 1.3 to 3.5 may be realized when switching from edge-based to superedge or chain-based loops.
Back to Top
Document information
Published on 01/01/1994
DOI: 10.1016/0045-7825(94)90133-3
Licence: CC BY-NC-SA license
Share this document
claim authorship
Are you one of the authors of this document?