Sriram Sellappa and Siddhartha Chatterjee. Cacheefficient multigrid algorithms. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....do not apply to Gauss Seidel because it has data dependences within the convergence iteration. We use graph partitioning of the sub matrices to give our owner computes simulation better intra iteration locality. Work which looks at inter iteration locality on regular grids includes [6] 32] [29], 21] and [36] The only other technique to our knowledge which handles inter iteration locality for irregular meshes is unstructured cache blocking by Douglas et al. 12] We have implemented this technique in our experimental framework and refer to it as cache block sparse tiling in this ....

Sriram Sellappa and Siddhartha Chatterjee. Cacheefficient multigrid algorithms. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.

....operations. Temporal blocking is a loop transformation comparable to the loop transformation tiling. They applied temporal blocking to the Jacobi method but did not show how temporal blocking can be applied to red black Gauss Seidel or multigrid methods. Finally, recent work by Sellappa et al. SC01] is based on the temporal blocking idea. They present a two dimensional blocking strategy for the Gauss Seidel method based on a standard and red black ordering of the unknowns. The approach is comparable to the square two dimensional blocking technique described in this thesis. They do ....

S. Sellappa and S. Chatterjee. Cache--Efficient Multigrid Algorithms. In Proceedings of the 2001 International Conference on Computational Science (ICCS 2001), volume 2073 and 2074 of Lecture Notes in Computer Science, pages 107--116, San Francisco, California, USA, May 2001. Springer.

....techniques only improve intra iteration locality, because the convergence iteration loop is not usually implemented in a way that compilers can recognize it as associated with the loop over the regular mesh. Work which looks at inter iteration locality on regular grids includes [2] 20] and [19]. There has also been work on run time techniques for improving the intra iteration locality for irregular meshes which applies a data reordering and computation rescheduling within a single convergence iteration [16, 17, 4, 11, 8] However, many of these techniques do not apply to Gauss Seidel ....

Sriram Sellappa and Siddhartha Chatterjee. Cache-efficient multigrid algorithms. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.

No context found.

Sriram Sellappa and Siddhartha Chatterjee. Cacheefficient multigrid algorithms. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC