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
Constraint programs containing a matrix of two (or more) dimensions of decision variables often have...
Algorithms for the sparse matrix-vector multiplication (shortly SpMxV) are important building blocks...
In this paper, we analyse and compare the techniques of algorithmic blocking and (storage blocking w...
Two-dimensional arrays are generally arranged in memory in row-major order or column-major order. Tr...
Hierarchically-blocked non-linear storage layouts, such as the Morton ordering, have been proposed a...
Abstract. Morton layout is a compromise storage layout between the programming language mandated lay...
Programming languages that provide multidimensional arrays and a flat linear model of memory must im...
A proof of concept is offered for the uniform representation of matrices serially in Morton-order (o...
This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient wa...
Abstract: Suppose the bits of a computer word are partitioned into d disjoint sets, each of which is...
Abstract—This paper presents a data layout optimization technique for sequential and parallel progra...
Strassen's algorithm for matrix multiplication gains its lower arithmetic complexityatthe expe...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
Matrix multiplication may be considered as a model problem for analyzing the performance of more com...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
Constraint programs containing a matrix of two (or more) dimensions of decision variables often have...
Algorithms for the sparse matrix-vector multiplication (shortly SpMxV) are important building blocks...
In this paper, we analyse and compare the techniques of algorithmic blocking and (storage blocking w...
Two-dimensional arrays are generally arranged in memory in row-major order or column-major order. Tr...
Hierarchically-blocked non-linear storage layouts, such as the Morton ordering, have been proposed a...
Abstract. Morton layout is a compromise storage layout between the programming language mandated lay...
Programming languages that provide multidimensional arrays and a flat linear model of memory must im...
A proof of concept is offered for the uniform representation of matrices serially in Morton-order (o...
This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient wa...
Abstract: Suppose the bits of a computer word are partitioned into d disjoint sets, each of which is...
Abstract—This paper presents a data layout optimization technique for sequential and parallel progra...
Strassen's algorithm for matrix multiplication gains its lower arithmetic complexityatthe expe...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
Matrix multiplication may be considered as a model problem for analyzing the performance of more com...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
Constraint programs containing a matrix of two (or more) dimensions of decision variables often have...
Algorithms for the sparse matrix-vector multiplication (shortly SpMxV) are important building blocks...
In this paper, we analyse and compare the techniques of algorithmic blocking and (storage blocking w...