# Developers:References about cache optimization

M. J. Aftosmis, M. J. Berger, and S. M. Murmann. Applications of Space-Filling Curves to Cartesian Methods for CFD. Technical Report NAS-04-001, NASA Advanced Super- computing Division, March 2004. Available from World Wide Web: http://people.nas.nasa.gov/~aftosmis/publications/aiaa2004_1232.pdf [cited February 25, 2007].

G. Breinholt and C. Schierz. Algorithm 781: generating Hilbert’s space-filling curve by recursion. ACM Trans. Math. Softw., 24(2):184–189, 1998.

A. R. Butz. Alternative Algorithm for Hilbert's Space-Filling Curve. IEEE Transactions on Computers, C-20(4):424–426, 1971.

C. C. Douglas, J. Hu, M. Kowarschik, U. Ruede, and C. Weiss. Cache optimization for structured and unstructured grid multigrid. Elect. Trans. Numer. Anal., 10:21–40, 2000. Available from World Wide Web: http://etna.mcs.kent.edu/vol.10.2000/pp21-40.dir/pp21-40.pdf [cited March 5, 1007].

F. Guenther, M. Mehl, M. Poegl, and C. Zenger. A cache-aware algorithm for PDEs on hierarchical data structures based on space- filling curves. SIAM Journal on Scientific Computing, 28(5):1634– 1650, 2004. Available from World Wide Web: http://www5.in.tum.de/pub/int/guenther_siam06.pdf [cited February 25, 2007].

H. Han, G. Rivera, and C. Tseng. Software support for improving locality in scientific codes. In Proceedings of the Eighth International Workshop on Compilers for Parallel Computers (CPC’2000), Aussois, France, January 2000. Available from World Wide Web: http://www.cs.umd.edu/projects/cosmic/papers/cpc2000.ps [cited February 25, 2007].

M. Kowarschik and C. Weiss. An Overview of Cache Optimization Techniques and Cache Aware Numerical Algorithms, 2003. Available from World Wide Web: http://citeseer.ist.psu.edu/kowarschik03overview.html.

J. K. Lawder. Using Space-Filling Curves for Multi-dimensional Indexing. Technical Report JL1/00, Birkbeck College, University of London, 2000. Available from World Wide Web: http://www.dcs.bbk.ac.uk/TriStarp/pubs/bncod17.pdf [cited February 25, 2007].

J. K. Lawder and P. J. H. King. Using Space-Filling Curves for Multi-dimensional Indexing. In BNCOD 17: Proceedings of the 17th British National Conferenc on Databases, pages 20–35. Springer, 2000. Available from World Wide Web: http://www.dcs.bbk.ac.uk/TriStarp/pubs/bncod17.pdf [cited February 27, 2007].

J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings. Int. J. Parallel Program., 29(3):217–247, 2001.

G. Rivera and C.-W. Tseng. A Comparison of Compiler Tiling Algorithms. In Computational Complexity, pages 168–182, 1999. Available from World Wide Web: http://www.cs.umd.edu/projects/cosmic/papers/cc99.ps [cited March 2, 2007].

G. Rivera and C.-W. Tseng. Tiling Optimizations for 3D Scientific Computations. In Supercomputing, 2000. Available from World Wide Web: http://www.cs.umd.edu/projects/cosmic/papers/sc00.ps [cited March 2, 2007]

M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, pages 30–44. ACM Press, 1991. Available from World Wide Web: http://suif.stanford.edu/papers/wolf91a.pdf [cited March 5, 2007].