scholarly journals Improving Parallel I/O Performance with Data Layout Awareness

2010 ◽  
Author(s):  
Yong Chen ◽  
Xian-He Sun ◽  
Rajeev Thakur ◽  
Huaiming Song ◽  
Hui Jin
Keyword(s):  
Data Layout

Data layout optimization for GPGPU architectures

2013 ◽  
Vol 48 (8) ◽  
pp. 283-284 ◽  
Author(s):  
Jun Liu ◽  
Wei Ding ◽  
Ohyoung Jang ◽  
Mahmut Kandemir
Keyword(s):  
Layout Optimization ◽  
Data Layout ◽  
Data Layout Optimization

scholarly journals A structure-exploiting numbering algorithm for finite elements on extruded meshes, and its performance evaluation in Firedrake

2016 ◽  
Vol 9 (10) ◽  
pp. 3803-3815 ◽  
Author(s):  
Gheorghe-Teodor Bercea ◽  
Andrew T. T. McRae ◽  
David A. Ham ◽  
Lawrence Mitchell ◽  
Florian Rathgeber ◽  
...  
Keyword(s):  
Finite Element ◽  
Performance Evaluation ◽  
Finite Elements ◽  
Aspect Ratio ◽  
Three Dimensional ◽  
Data Layout ◽  
Element System ◽  
Continuous Galerkin ◽  
Performance Penalty ◽  
The Cost

Abstract. We present a generic algorithm for numbering and then efficiently iterating over the data values attached to an extruded mesh. An extruded mesh is formed by replicating an existing mesh, assumed to be unstructured, to form layers of prismatic cells. Applications of extruded meshes include, but are not limited to, the representation of three-dimensional high aspect ratio domains employed by geophysical finite element simulations. These meshes are structured in the extruded direction. The algorithm presented here exploits this structure to avoid the performance penalty traditionally associated with unstructured meshes. We evaluate the implementation of this algorithm in the Firedrake finite element system on a range of low compute intensity operations which constitute worst cases for data layout performance exploration. The experiments show that having structure along the extruded direction enables the cost of the indirect data accesses to be amortized after 10–20 layers as long as the underlying mesh is well ordered. We characterize the resulting spatial and temporal reuse in a representative set of both continuous-Galerkin and discontinuous-Galerkin discretizations. On meshes with realistic numbers of layers the performance achieved is between 70 and 90 % of a theoretical hardware-specific limit.

scholarly journals Enhancing spatial locality via data layout optimizations

1998 ◽  
pp. 422-434 ◽  
Author(s):  
M. Kandemir ◽  
A. Choudhary ◽  
J. Ramanujam ◽  
N. Shenoy ◽  
P. Banerjee
Keyword(s):  
Data Layout ◽  
Spatial Locality

A Data Layout with Good Data Locality for Single-Machine based Graph Engines

2021 ◽  
pp. 1-1
Author(s):  
Yong-Yeon Jo ◽  
Myung-Hwan Jang ◽  
Sang-Wook Kim ◽  
Sunju Park
Keyword(s):  
Single Machine ◽  
Data Locality ◽  
Data Layout ◽  
Good Data
Sign in / Sign up

Export Citation Format

Share Document