Adjacency-based data reordering algorithm for acceleration of finite element computations

Scientific Programming

Volumn 18, Issue 2, 2010, Pages 107-123

  Zhou, Min ^a   Sahni, Onkar ^a   Shephard, Mark S ^a   Carothers, Christopher D ^a   Jansen, Kenneth E ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b University of Colorado at Boulder   (United States)

Author keywords

cache penalty model; Data reordering; finite element analysis; unstructured mesh

Indexed keywords

CACHE MEMORY; FINITE ELEMENT METHOD; GENES; MEMORY ARCHITECTURE; MESH GENERATION;

BLUE GENE; CACHE MISS; CACHE PENALTY MODELS; DATA REORDERING; FINITE ELEMENT ANALYSE; FINITE ELEMENT COMPUTATIONS; MEMORY HIERARCHY; MESH VERTEX; PROCESSOR MEMORY; UNSTRUCTURED MESHES;

SUPERCOMPUTERS;

EID: 77954751611     PISSN: 10589244     EISSN: None     Source Type: Journal    
DOI: 10.1155/2010/273921     Document Type: Article

References (33)

1. M. Beall, An object-oriented framework for the reliable automated solution of problems in mathematical physics, PhD thesis, Rensselaer Polytechnic Institute, May 1999.
2. M.W. Beall and M.S. Shephard, A general topology-based mesh data structure, Int. J. Numer. Methods Engrg. 40(9) (1997), 1573-1596.
3. D.A. Burgess and M.B. Giles, Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines, Adv. Engrg. Soft. 28 (1997), 189-201.
4. A.L.G.A. Coutinho and M.A.D. Martins, Performance comparison of data-reordering algorithms for sparse matrix-vector multiplication in edge-based unstructured grid computations, Int. J. Numer. Methods Engrg. 66 (2006), 431-460.
5. H.L. Crane Jr., N.E. Gibbs, W.G. Poole Jr. and P.K. Stockmeyer, Matrix bandwidth and profile reduction, ACM Trans. Math. Soft. 2 (1976), 375-377.
6. E. Cuthill and J. McKee, Reducing the bandwidth of sparse symmetric matrices, in: Proc. 24th Nat. Conf. ACM, ACM, New York, NY, USA, 1969, pp. 157-172.
7. K. Devine, E. Boman, R. Heaphy, B. Hendrickson and C. Vaughan, Zoltan data management services for parallel dynamic applications, Comput. Sci. Eng. 4(2) (2002), 90-97.
8. N.E. Gibbs, W.G. Poole Jr. and P.K. Stockmeyer, An algorithm for reducing the bandwidth and profile of sparse matrix, SIAM J. Numer. Anal. 13 (1976), 236-250.
9. N.E. Gibbs, W.G. Poole Jr. and P.K. Stockmeyer, A comparison of several bandwidth and profile reduction algorithm, ACM Trans. Math. Soft. 2 (1976), 322-330.
10. H. Han and C.W. Tseng, Exploiting locality for irregular scientific codes, IEEE Trans. Parallel Distrib. Systems 17 (2006), 606-618.
11. G. Heber, R. Biswas and G.R. Gao, Self-avoiding walks over adaptive unstructured grids, Concurrency Pract. Exper. 12 (2000), 85-109.
12. http://www.anandtech.com/.
13. http://techreport.com/articles.x/13176/3.
14. K.E. Jansen, C.H. Whiting and G.M. Hulbert, Generalized- α method for integrating the filtered Navier-Stokes equations with a stabilized finite element method, Comput. Methods Appl. Mech. Engrg. 190(3,4) (2000), 305-319.
15. G. Karypis and V. Kumar, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, in: 10th Intl. Parallel Processing Symposium, IEEE Computer Society, Washington, DC, USA, 1996, pp. 314-319.
16. R. Löhner, Renumbering strategies for unstructured-grid solvers operating on shared-memory, cache-based parallel machines, Comput. Methods Appl. Mech. Engrg. 163 (1998), 95-109.
17. R. Löhner and M. Galle, Minimization of indirect addressing for edge-based field solvers, Commun. Numer. Methods Engrg. 18(5) (2002), 335-343.
18. L. Oliker, X. Li, P. Husbands and R. Biswas, Ordering schemes for sparse matrices using modern programming paradigms, LBNL47803, 2000.
19. L. Oliker, X. Li, P. Husbands and R. Biswas, Parallel conjugate gradient: effects of ordering strategies, programming paradigms, and architectural platforms, LBNL45828, 2000.
20. L. Oliker, X. Li, P. Husbands and R. Biswas, Effects of ordering strategies and programming paradigms on sparse matrix computations, SIAM Rev. 44 (2002), 373-393.
21. J.C. Pichel, D.E. Singh and J. Carretero, Reordering algorithms for increasing locality on multicore processors, in: Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications, IEEE Computer Society,Washington, DC, USA, September 2008, pp. 123-130.
22. J.F. Remacle, O. Klaas, J.E. Flaherty and M.S. Shephard, A parallel algorithm oriented mesh database, Eng. Comput. 18 (2002), 274-284.
23. Y. Saad and M.H. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 7 (1986), 856-869.
24. O. Sahni, Y.Müller, K.E. Jansen, M.S. Shephard and C.A. Taylor, Efficient anisotropic adaptive discretization of the cardiovascular system, Comput. Methods Appl. Mech. Engrg. 195 (2006), 5634-5655.
25. E.S. Seol and M.S. Shephard, Efficient distributed mesh data structure for parallel automated adaptive analysis, Eng. Comput. 22(3,4) (2006), 197-213.
26. F. Shakib, T.J.R. Hughes and Z. Johan, A multi-element group preconditioned GMRES algorithm for nonsymmetric systems arising in finite element analysis, Comput. Methods Appl. Mech. Engrg. 75 (1989), 415-456.
27. M.M. Strout and P.D. Hovland, Metrics and models for reordering transformations, in: Proceedings of the 2nd ACMSIGPLAN Workshop on Memory System Performance (MSP), June 2005, ACM, New York, NY, USA, 2005, pp. 23-34.
28. I.E. Vigon-Clementel, C.A. Figueroa, K.E. Jansen and C.A. Taylor, Outflow boundary conditions for three-dimensional finite element modeling of blood flow and pressure in arteries, Comput. Mehtods Appl. Mech. Engrg. 195 (2006), 3776-3796.
29. B. Waldecker, Amd technical briefing, available at: http:// www.nccs.gov/wp-content/training/scaling-workshop-pdfs/ AMD- ORNL-073007.pdf.
30. C.H. Whiting and K.E. Jansen, A stabilized finite element method for the incompressible Navier-Stokes equations using a hierarchical basis, Int. J. Numer. Meth. Fluids 35 (2001), 93-116.
31. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick and J. Demmel, Optimization of sparse matrix-vector multiplication on emerging multicore platforms, Parallel Comput. 35 (2009), 178-194.
32. J. Womersley, Method for the calculation of velocity, rate of flow and viscous drag in arteries when the pressure gradient is known, J. Physiol. 127 (1955), 553-563.
33. A.N. Yzelman and R.H. Bisseling, Cache-oblivious sparse matrix-vector multiplication by using sparse matrix partitioning methods, SIAM J. Sci. Comput. 31 (2009), 3128-3254.