Abstract
AbstractA 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. Copyright © 2002 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
