Minimizing Associativity Conflicts in Morton Layout
Hierarchically-blocked non-linear storage layouts, such as the Morton ordering, have been shown to be a potentially attractive compromise between row-major and column-major for two-dimensional arrays. When combined with appropriate optimizations, Morton layout offers some spatial locality whether traversed row- or column-wise. However, for linear algebra routines with larger problem sizes, the layout shows diminishing returns. It is our hypothesis that associativity conflicts between Morton blocks cause this behavior and we show that carefully arranging the Morton blocks can minimize this effect. We explore one such arrangement and report our preliminary results.
KeywordsCache Line Large Problem Size Page Size Array Layout Associative Cache
Unable to display preview. Download preview PDF.
- 2.Wise, D.S., Frens, J.D., Gu, Y., Alexander, G.A.: Language support for morton-order matrices. In: PPoPP 2001: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, pp. 24–33 (2001)Google Scholar
- 3.Chatterjee, S., Lebeck, A.R., Patnala, P.K., Thottethodi, M.: Recursive array layouts and fast parallel matrix multiplication. In: SPAA 1999: Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 222–231 (1999)Google Scholar
- 4.Chatterjee, S., Jain, V.V., Lebeck, A.R., Mundhra, S., Thottethodi, M.: Nonlinear array layouts for hierarchical memory systems. In: ICS 1999: Proceedings of the 13th International Conference on Supercomputing, pp. 444–453 (1999)Google Scholar
- 7.Thiyagalingam, J.: Alternative Array Storage Layouts for Regular Scientific Programs. PhD thesis, Department of Computing, Imperial College, London, U.K. (2005)Google Scholar
- 8.SPEC 2000 CPU Benchmarks (2000), http://www.specbench.org/