to reduce this seek time, redun-dant data storage has been proposed in the literature, but the redundancy factors of those layouts are pro-hibitively high. In this paper, we develop a cost model for the seek time of a layout. Based on this cost model, we propose an elegant algorithm that computes a re

Object-oriented programs rely heavily on objects and pointers, making them vulnerable to slowdowns from cache and TLB misses. The cache and TLB behavior depends on the data layout of objects in memory. There are many possible data layouts with different impacts on performance, but it is not known

rtunity to take advantage of available indexes in the data repository. Moreover, in the case where the operation is a selection or an aggregate operation, evaluating the operation in the data repository can significant reduce the overhead of data transfer between the data repository and Conquest

Abstract not found

on GPUs, such as the fermion force, gauge force and fat link computation. The most expensive operation in the CG solver is the dslash operation Data for spinors and gauge links is rearranged on the host before it is copied to the device memory to enable coalesced memory access We have implemented

High Performance Fortran (HPF) is rapidly gaining acceptance as a language for parallel programming. The goal of HPF is to provide a simple yet ecient machine independent parallel programming model. Besides the algorithm selection, the data layout choice is the key intellectual step in writing

In this paper, we describe a generalized approach to deriving a custom data layout in multiple memory banks for array-based computations, to facilitate high-bandwidth parallel memory accesses in modern architectures where multiple memory banks can simultaneously feed one or more functional units

high cache efficiency. Compiler optimizations to improve data locality for uniprocessors is increas...

Declustered data organizations in disk arrays (RAIDs) achieve less-intrusive reconstruction of data after a disk failure. We present PDDL, a new data layout for declustered disk arrays. PDDL layouts exist for a large variety of disk array configurations with a distributed spare disk. PDDL

Recently, several experimental studies have been conducted on block data layout as a data transformation technique used in conjunction with tiling to improve cache performance. In this paper, we provide a theoretical analysis for the TLB and cache performance of block data layout. For standard