Abstract. Morton layout is a compromise storage layout between the programming language mandated layouts row-major and column-major, providing substantial locality of reference when traversed in either direction. This paper explores the performance of Morton, row-major and column-major layouts in detail on some representative architectures. Using a small suite of dense kernels working on two-dimensional arrays, we have carried out an extensive study of the impact of poor array layout and of whether Morton layout can offer an attractive compromise. Whether Morton layout is better than traversing a column-major array in row-major order (or vice versa) depends on problem size and architecture. Morton layout generally leads to much more consist...
Despite their clear advantage in scalability, two-dimensional data distributions are not efficiently...
The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet ef...
Designers of database management systems (DBMS) have traditionally focussed on alleviating the disk ...
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...
Hierarchically-blocked non-linear storage layouts, such as the Morton ordering, have been shown to b...
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...
Submitted for publication to IEEE TPDS The performance of both serial and parallel implementations o...
This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient wa...
The literature has witnessed much work aimed at improving the efficiency of mernory systems. The mot...
Strassen's algorithm for matrix multiplication gains its lower arithmetic complexityatthe expe...
There are two obvious ways to map a two-dimension relational database table onto a one-dimensional s...
This paper describes a new approach to managing array data layouts to optimize performance for scien...
The system efficiency and throughput of most architectures are critically dependent on the ability o...
Despite their clear advantage in scalability, two-dimensional data distributions are not efficiently...
The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet ef...
Designers of database management systems (DBMS) have traditionally focussed on alleviating the disk ...
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...
Hierarchically-blocked non-linear storage layouts, such as the Morton ordering, have been shown to b...
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...
Submitted for publication to IEEE TPDS The performance of both serial and parallel implementations o...
This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient wa...
The literature has witnessed much work aimed at improving the efficiency of mernory systems. The mot...
Strassen's algorithm for matrix multiplication gains its lower arithmetic complexityatthe expe...
There are two obvious ways to map a two-dimension relational database table onto a one-dimensional s...
This paper describes a new approach to managing array data layouts to optimize performance for scien...
The system efficiency and throughput of most architectures are critically dependent on the ability o...
Despite their clear advantage in scalability, two-dimensional data distributions are not efficiently...
The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a simple yet ef...
Designers of database management systems (DBMS) have traditionally focussed on alleviating the disk ...