Improving the performance of morton layout by array alignment and loop unrolling reducing the price of naivety

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

Volumn 2958, Issue , 2004, Pages 241-257

  Thiyagalingam, Jeyarajan ^a   Beckmann, Olav ^a   Kelly, Paul H J ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

LOOP UNROLLING; MORTON ORDER; NON LINEAR; SPATIAL LOCALITY; STORAGE LAYOUTS; TWO-DIMENSIONAL ARRAYS;

ARTIFICIAL INTELLIGENCE;

EID: 35048894812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24644-2_16     Document Type: Article

References (12)

1. Bowen Alpern, Larry Carter, Ephraim Feig, and Ted Selker. The uniform memory hierarchy model of computation. Algorithmica, 12(2/3):72-109, August/September 1994.
2. Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Lebeck, Shyam Mundhra, and Mithuna Thottethodi. Nonlinear array layouts for hierarchical memory systems. In ICS '99: Proceedings of the 1999 International Conference on Supercomputing, pages 444-453, June 20-25, 1999.
3. Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K. Patnala, and Mithuna Thottethodi. Recursive array layouts and fast parallel matrix multiplication. In SPAA '99: Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pages 222-231, New York, June 1999.
4. Peter Drakenberg, Fredrik Lundevall, and Björn Lisper. An efficient semihierarchical array layout. In Proceedings of the Workshop on Interaction between Compilers and Computer Architectures, Monterrey, Mexico, January 2001. Kluwer. Available via www.mrtc.mdh.se «http://www.mrtc.mdh.se».
5. F. Gustavson, A. Henriksson, I. Jonsson, and B. Kaagstroem. Recursive blocked data formats and BLAS's for dense linear algebra algorithms. In PARA '98: Applied Parallel Computing. Large Scale Scientific and Industrial Problems, volume 1541 of LNCS, pages 195-206, 1998.
6. D. Hilbert. Über die stetige Abbildung einer Linie auf ein Flächenstück. Math. Ann., 38:459-460, 1891.
7. Gabriel Rivera and Chau-Wen Tseng. Data transformations for eliminating conflict misses. In PLDI '98: Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation, pages 38-49, Montreal, Canada, 17-19 June 1998.
8. th Annual UK Performance Engineering Workshop, pages 340-351. University of Warwick, UK, July 2003.
9. Jeyarajan Thiyagalingam, Olav Beckmann, and Paul H.J. Kelly. Improving the performance of basic morton layout by array alignment and loop unrolling - towards a better compromise storage layout. Technical report, Department of Computing, Imperial College London, September 2003. Available via www.doc.ic.ac.uk/~jeyan/.
10. Vinod Valsalam and Anthony Skjellum. A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels. Concurrency and Computation: Practice and Experience, 14(10):805-839, August 2002.
11. David S. Wise and Jeremy D. Frens. Morton-order Matrices Deserve Compilers' Support. Technical Report, TR533, November 1999.
12. David S. Wise, Jeremy D. Frens, Yuhong Gu, and Gregory A. Alexander. Language support for Morton-order matrices. ACM SIGPLAN Notices, 36(7):24-33, July 2001. Proceedings of PPoPP 2001.