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

@article{Zhou2010AdjacencybasedDR,
  title={Adjacency-based data reordering algorithm for acceleration of finite element computations},
  author={Min Zhou and Onkar Sahni and Mark S. Shephard and Christopher D. Carothers and Kenneth E. Jansen},
  journal={Scientific Programming},
  year={2010},
  volume={18},
  pages={107-123}
}
Effective use of the processor memory hierarchy is an important issue in high performance computing. In this work, a part level mesh topological traversal algorithm is used to define a reordering of both mesh vertices and regions that increases the spatial locality of data and improves overall cache utilization during on processor finite element calculations. Examples based on adaptively created unstructured meshes are considered to demonstrate the effectiveness of the procedure in cases where… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Locality-Aware Laplacian Mesh Smoothing

2016 45th International Conference on Parallel Processing (ICPP) • 2016
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 35 references

A comparison of several bandwidth and profile reduction algorithm

N. E. Gibbs, W.G.Poole, P. K. Stockmeyer
ACM Trans. Math. Softw., • 1976
View 4 Excerpts
Highly Influenced

An algorithm for reducing the bandwidth and profile of sparse matrix

N. E. Gibbs, W.G.Poole, P. K. Stockmeyer
SIAM J. Numer. Anal., • 1976
View 4 Excerpts
Highly Influenced

Reordering Algorithms for Increasing Locality on Multicore Processors

2008 10th IEEE International Conference on High Performance Computing and Communications • 2008
View 2 Excerpts

Exploiting locality for irregular scientific codes

IEEE Transactions on Parallel and Distributed Systems • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…