Abstract
Most current-day microprocessor designs are characterized by fast processors and slow main memory. The performance gap is usually reduced by using small and fast cache memory as a buffer to main memory. In order to achieve good performance, it is necessary for an algorithm to reduce cache misses. In this paper, we study the performance characteristics of several basic iterative kernels on a single microprocessor of the SGI Cray Origin 2000 system. For large problem sizes, the performance of the global preconditioned conjugate gradient (PCG) method is limited by frequent access to slow main memory. On the other hand, the additive Schwarz PCG method shows much better performance because of effective utilization of the cache memory.
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 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.
