Abstract
We consider the hyperplane ordering vectorization with the least effect of memory bank conflict on vector computers. The hyperplane ordering is often used in the incomplete Cholesky conjugate gradient (ICCG) method in order to solve systems of linear equations which result from discretization of partial differential equations. We show that the performance of hyperplane ordering on currently used vector computers depends upon the magnitude of the access stride to memory and the total count of the access strides. We estimate precisely the magnitude of the access stride to memory and its total count which are determined by the numbers of gridpoints in the three directions of 3D domains. We give a recipe on how to choose the numbers of gridpoints in the x-, y-, z-directions for efficient solution of 3D problems by the ICCG method.
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 callDisclaimer: 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.
