Fast indexing for blocked array layouts to reduce cache misses. (3rd April 2006)

• Record Type: Journal Article
• Authors: Athanasaki, Evangelia; Koziris, Nectarios
• Is Part Of: International journal of high performance computing and networking. Volume 3:Number 5/6(2005)
• Page Start: 417
• Page End: 433
• Publication Date: 2006-04-03
• Subjects: cache locality -- loop tiling -- blocked array layouts -- fast indexing -- code optimisation -- reference locality -- cache misses -- memory layout -- multi-dimensional arrays -- simulation -- data locality; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

Several studies have been conducted on blocked data layouts, in conjunction with loop tiling to improve locality of references. In this paper, we further reduce cache misses, restructuring the memory layout of multi-dimensional arrays, so that array elements are stored in a blocked way, exactly as they are swept by the tiled instruction stream. A straightforward way is presented to easily translate multi-dimensional indexing of arrays into their blocked memory layout using quick and simple binary-mask operations. Actual experimental results and simulations illustrate that performance is greatly improved because of the considerable reduction of cache misses.