Results 1 - 10 of 142

Efficient layout transformation for disk-based multidimensional arrays

by Sriram Krishnamoorthy, Gerald Baumgartner, Chi-chung Lam, Jarek Nieplocha - In HiPC. 386–398 , 2004
"... Abstract. I/O libraries such as PANDA and DRA use blocked layouts for efficient access to disk-resident multi-dimensional arrays, with the shape of the blocks being chosen to match the expected access pattern of the array. Sometimes, different applications, or different phases of the same applicatio ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. I/O libraries such as PANDA and DRA use blocked layouts for efficient access to disk-resident multi-dimensional arrays, with the shape of the blocks being chosen to match the expected access pattern of the array. Sometimes, different applications, or different phases of the same

Nonlinear Array Layouts for Hierarchical Memory Systems

by Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Lebeck, Shyam Mundhra, Mithuna Thottethodi , 1999
"... Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory. This layout function is fixed at language definition time and constitutes an invisible, non-programmable array attribute. ..."
Abstract - Cited by 76 (5 self) - Add to MetaCart
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory. This layout function is fixed at language definition time and constitutes an invisible, non-programmable array attribute

An Efficient Semi-Hierarchical Array Layout

by N. P. Drakenberg, F. Lundevall, B. Lisper - In Proceedings of the Workshop on Interaction between Compilers and Computer Architectures , 2001
"... For high-level programming languages, linear array layout (e.g., column major and row major orders) have de facto been the sole form of mapping array elements to memory. The increasingly deep and complex memory hierarchies present in current computer systems expose several deficiencies of linear arr ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
array layouts. One such deficiency is that linear array layouts strongly favor locality in one index dimension of multidimensional arrays. Secondly, the exact mapping of array elements to cache locations depend on the array's size, which effectively renders linear array layouts non

Layout Transformation Support for the Disk Resident Arrays Framework ∗

by Sriram Krishnamoorthy, Gerald Baumgartner, Chi-chung Lam, Jarek Nieplocha
"... The Global Arrays (GA) toolkit provides a sharedmemory programming model in which data locality is explicitly managed by the programmer. It inter-operates with MPI and supports a variety of language bindings. The Disk Resident Arrays (DRA) model extends the GA programming model to secondary storage. ..."
Abstract - Add to MetaCart
of layout transformation support to DRA. The implementation of an efficient parallel layout transformation algorithm is done on top of existing GA/DRA functions; thus GA/DRA is itself used in implementing the enhanced DRA functionality. Experimental performance data is provided that demonstrates

Efficient Execution of Operations in a DBMS for Multidimensional Arrays

by Norbert Widmann, Peter Baumann - In SSDBM , 1998
"... In the RasDaMan project a database system for management of multdimensional arrays is being built. It offers a declarative query language extending SQL-92 with operations on arrays of arbitrary base types and a C++ programming interface. Integrating arrays in the query language enables the system to ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
are then executed on tiles loaded from mass storage. This paper describes the underlying formal model for tile based operations on multidimensional arrays and its efficient implementation in C++ as part of the RasDaMan system. 1. Introduction Multidimensional arrays have been used in scientific computing for a

Automatic Memory Layout Transformations to Optimize Spatial Locality in Parameterized Loop Nests

by Philippe Clauss, Benoît Meister , 2000
"... One of the most efficient ways to improve program performances onto nowadays computers is to optimize the way cache memories are used. In particular, many scientic applications contain loop nests that operate on large multi-dimensional arrays whose sizes are often parameterized. No special attention ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
One of the most efficient ways to improve program performances onto nowadays computers is to optimize the way cache memories are used. In particular, many scientic applications contain loop nests that operate on large multi-dimensional arrays whose sizes are often parameterized. No special

Multidimensional blocking in UPC

by Christopher Barton, George Almasi, Rahul Garg, Jose ́ Nelson, Montse Farreras , 2007
"... Abstract. Partitioned Global Address Space (PGAS) languages offer an attrac-tive, high-productivity programming model for programming large-scale paral-lel machines. PGAS languages, such as Unified Parallel C (UPC), combine the simplicity of shared-memory programming with the efficiency of the messa ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
, in the language. We describe an analysis that allows the compiler to distinguish between local shared array accesses and remote shared array accesses. Local shared array ac-cesses are then transformed into direct memory accesses by the compiler, saving the overhead of a locality check at runtime. We present

Efficient Data Mappings for Parity-Declustered Data Layouts

by Eric J. Schwabe, Ian M. Sutherland , 2002
"... The joint demands of high performance and fault tolerance in a large array of disks can be satisfied by a parity-declustered data layout – an arrangement of data and redundant information that allows the rapid reconstruction of lost data while the array continues to operate. A data layout is typical ..."
Abstract - Add to MetaCart
to store tables. In this paper, we show that parity-declustered data layouts based on commutative rings yield mappings with improved computational efficiency. These layouts also apply to a wider range of array configurations than other known layouts that do not use table lookup.

Efficient Region Layouts for Region-based Video Servers Employing Multi-zone Disks

by Sheau-ru Tong, Yuan-tse Yu, Chung-ming Huang , 2002
"... This paper investigates the implementation of video servers employing multi-zone disks. A multi-zone disk consists of a set of concentric disk zones with non-uniform storage capacities and data transfer rates. Superimposing a customized region layout on the top of such a disk is essential for facili ..."
Abstract - Add to MetaCart
for facilitating the video server design and improving the disk resource utilization. This paper develops theories concerning the optimal region layouts for implementing the region-based data placement. Based on them, two efficient region layout algorithms are proposed, namely, the free-π scheme and fixed-π scheme

Nonlinear Array Layouts for Hierarchical Memory Systems

by Siddhartha Chatterjeey, Vibhor V. Jainy, Alvin R. Lebeckz, Shyam Mundhray, Mithuna Thottethodiz
"... Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory. This layout function is fixed at language definition time and constitutes an in-visible, non-programmable array attribute ..."
Abstract - Add to MetaCart
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory. This layout function is fixed at language definition time and constitutes an in-visible, non-programmable array
Results 1 - 10 of 142