Morton ordering of 2D arrays for efficient access to hierarchical memory

Walker, David W. ORCID: https://orcid.org/0000-0002-1360-6330 2018. Morton ordering of 2D arrays for efficient access to hierarchical memory. International Journal of High Performance Computing Applications 32 (1) , pp. 189-203. 10.1177/1094342017725568

Preview

PDF - Accepted Post-Print Version Download (553kB) | Preview

Abstract

This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient way to access hierarchical memory across a range of heterogeneous computer platforms, ranging from manycore devices, multicore processors, clusters and distributed environments. A brief overview of previous research in this area is given, and algorithms that make use of Morton ordering are described. These are then used to investigate the efficiency of the Morton ordering approach by performance experiments on different processors. In particular, timing results are presented for matrix multiplication, Cholesky factorization and fast Fourier transform algorithms. The use of the Morton ordering approach leads naturally to algorithms that are recursive and exposes parallelism at each level of recursion. Thus, the approach advocated in this talk not only provides convenient and efficient access to hierarchical memory but also provides a basis for exploiting parallelism.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	SAGE Publications
ISSN:	1094-3420
Date of First Compliant Deposit:	5 September 2017
Date of Acceptance:	13 July 2017
Last Modified:	05 Dec 2024 01:45
URI:	https://orca.cardiff.ac.uk/id/eprint/104332

Citation Data

Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item