Combining performance aspects of irregular Gauss-Seidel via Sparse tiling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2481 LNCS, Issue , 2005, Pages 90-110

  Strout, Michelle Mills ^a   Carter, Larry ^a   Ferrante, Jeanne ^a   Freeman, Jonathan ^a   Kreaseck, Barbara ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSS-SEIDEL; MULTIGRID; SPARSE TILING;

DATA REDUCTION; ITERATIVE METHODS; NUMERICAL METHODS; PARALLEL PROCESSING SYSTEMS;

PROBLEM SOLVING;

EID: 33745140812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596110_7     Document Type: Conference Paper

References (36)

1. Mark F. Adams. Finite element market, http://www.cs.berkeley.edu/~madams/ femarket/index.html.
2. Mark F. Adams. A distributed memory unstructured Gauss-Seidel algorithm for multigrid smoothers. In ACM, editor, SC2001: High Performance Networking and Computing. Denver, CO, 2001.
3. Mark F. Adams. Evaluation of three unstructured multigrid methods on 3D finite element problems in solid mechanics. International Journal for Numerical Methods in Engineering, To Appear.
4. George Alms̀i and David Padua. Majic: Compiling matlab for speed and responsiveness. In PLDI 2002, 2002.
5. R. Barrett, M. Berry, T. F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd Edition. SIAM, Philadelphia, PA, 1994.
6. Frederico Bassetti, Kei Davis, and Dan Quinlan. Optimizing transformations of stencil operations for parallel object-oriented scientific frameworks on cache-based architectures. Lecture Notes in Computer Science, 1505, 1998.
7. Emergy Berger, Calvin Lin, and Samuel Z. Guyer. Customizing software libraries for performance portability. In 10th SIAM Conference on Parallel Processing for Scientific Computing, March 2001.
8. Steve Carr and Ken Kennedy. Compiler blockability of numerical algorithms. The Journal of Supercomputing, pages 114-124, November 1992.
9. Arun Chauhan and Ken Kennedy. Optimizing strategies for telescoping languages: Procedure strength reduction and procedure vectorization. In Proceedings of the 15th ACM International Conference on Supercomputing, pages 92-102, New York, 2001.
10. Joseph Culberson. Graph coloring programs. http://www.cs.ualberta.ca/ ~joe/Coloring/Colorsrc/index.html.
11. Chen Ding and Ken Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 229-241, Atlanta, Georgia, May 1-4, 1999.
12. Craig C. Douglas, Jonathan Hu, Markus Kowarschik, Ulrich Rüde, and Christian Weiß. Cache Optimization for Structured and Unstructured Grid Multigrid, Electronic Transaction on Numerical Analysis, pages 21-40, February 2000.
13. Dawson R. Engler. Interface compilation: Steps toward compiling program interfaces as languages. IEEE Transactions on Software Engineering, 25(3):387-400, May/June 1999.
14. Dennis Gannon, William Jalby, and Kyle Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distributed Computing, 5(5):587-616, October 1988.
15. M.J. Hagger. Automatic domain decomposition on unstructured grids (doug). Advances in Computational Mathematics, (9):281-310, 1998.
16. Hwansoo Han and Chau-Wen Tseng. A comparison of locality transformations for irregular codes. In 5th International Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers (LCR'2000). Springer, 2000.
17. Van Emden Henson and Ulrike Meier Yang. BoomerAMG: A parallel algebraic multigrid solver and preconditioner. Applied Numerical Mathematics: Transactions of IMACS, 41(1):155-177, 2002.
18. Michael Holst. Fetk - the finite element tool kit. http://www.fetk.org.
19. Eun-Jin Im. Optimizing the Performance of Sparse Matrix-Vector Multiply. Ph.d. thesis, University of California, Berkeley, May 2000.
20. F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of the 15th Annual ACM SIGPLAN Symposium on Priniciples of Programming Languages, pages 319-329, 1988.
21. Guohua Jin, John Mellor-Crummey, and Robert Fowler. Increasing temporal locality with skewing and recursive blocking. In SC2001: High Performance Networking and Computing, Denver, Colorado, November 2001. ACM Press and IEEE Computer Society Press.
22. George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 10 January 1998.
23. Induprakas Kodukula, Nawaaz Ahmed, and Keshav Pingali. Data-centric multi-level blocking. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-97), volume 32, 5 of ACM SIGPLAN Notices, pages 346-357, New York, June 15-18 1997. ACM Press.
24. Kathryn S. McKinley, Steve Carr, and Chau-Wen Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, July 1996.
25. John Mellor-Crummey, David Whalley, and Ken Kennedy. Improving memory hierarchy performance for irregular applications. In Proceedings of the 1999 Conference on Super-computing, ACM SIGARCH, pages 425-433, June 1999.
26. Nicholas Mitchell, Larry Carter, and Jeanne Ferrante. Localizing non-affine array references. In Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques (PACT '99), pages 192-202, Newport Beach, California, October 12-16, 1999. IEEE Computer Society Press.
27. William Pugh and Evan Rosser. Iteration space slicing for locality. In LCPC Workshop, La Jolla, California, August 1999. LCPC99 website.
28. Dan Quinlan. Rose: Compiler support for object-oriented frameworks. In Proceedings of Conference on Parallel Compilers (CPC2000), Aussois, France, January 2000. Also published in a special issue of Parallel Processing Letters, Vol.10.
29. 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 International Conference on Computational Science, Lecture Notes in Computer Science, San Francisco, CA, USA, May 28-30, 2001. Springer.
30. Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yuan-Shin Hwang, Raja Das, and Joel Saltz. Run-time and compile-time support for adaptive irregular problems. In Supercomputing '94. IEEE Computer Society, 1994.
31. Barry F. Smith, Fetter E. Bjørstad, and William Gropp. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.
32. Yonghong Song and Zhiyuan Li. New tiling techniques to improve cache temporal locality. ACM SIGPLAN Notices, 34(5):215-228, May 1999.
33. Michelle Mills Strout, Larry Carter, and Jeanne Ferrante. Rescheduling for locality in sparse matrix computations. In V.N.Alexandrov, J.J. Dongarra, and C.J.K.Tan, editors, Proceedings of the 2001 International Conference on Computational Science, Lecture Notes in Computer Science, New Haven, Connecticut, May 28-30, 2001. Springer.
34. Michael E. Wolf and Monica S. Lam. A data locality optimizing algorithm. In Programming Language Design and Implementation, 1991.
35. Michael J. Wolfe. Iteration space tiling for memory hierarchies. In Third SIAM Conference on Parallel Processing for Scientific Computing, pages 357-361, 1987.
36. David Wonnacott. Achieving scalable locality with time skewing. International Journal of Parallel Programming, 30(3):181-221, 2002.