WestminsterResearch

Minimizing associativity conflicts in Morton layout

Thiyagalingam, Jeyarajan and Beckmann, Olav and Kelly, Paul H.J. (2006) Minimizing associativity conflicts in Morton layout. In: Wyrzykowski, Roman and Dongarra, Jack and Meyer, Norbert and Wasniewski, Jerzy, (eds.) Parallel Processing and Applied Mathematics: 6th International Conference, PPAM 2005, Poznan, Poland, September 11-14, 2005, revised selected papers. Lecture notes in computer science (3911). Springer Verlag, Berlin, Germany, pp. 1082-1088. ISBN 3540341412

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/11752578_131

Abstract

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.

Item Type:Book Section
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:1496
Deposited On:08 May 2006
Last Modified:19 Oct 2009 16:09

Repository Staff Only: item control page