Affiliation:
1. University of Alberta, Edmonton, AB, Canada
2. IBM Toronto Software Laboratory, ON, Canada
Abstract
This article presents
Forma
, a practical, safe, and automatic data reshaping framework that reorganizes arrays to improve data locality.
Forma
splits large aggregated data-types into smaller ones to improve data locality. Arrays of these large data types are then replaced by multiple arrays of the smaller types. These new arrays form natural data streams that have smaller memory footprints, better locality, and are more suitable for hardware stream prefetching.
Forma
consists of a field-sensitive alias analyzer, a data type checker, a portable structure reshaping planner, and an array reshaper. An extensive experimental study compares different data reshaping strategies in two dimensions: (1) how the data structure is split into smaller ones (
maximal partition
×
frequency-based partition
×
affinity-based partition
); and (2) how partitioned arrays are linked to preserve program semantics (
address arithmetic-based reshaping
×
pointer-based reshaping
). This study exposes important characteristics of array reshaping. First, a practical data reshaper needs not only an inter-procedural analysis but also a data-type checker to make sure that array reshaping is safe. Second, the performance improvement due to array reshaping can be dramatic: standard benchmarks can run up to 2.1 times faster after array reshaping. Array reshaping may also result in some performance degradation for certain benchmarks. An extensive micro-architecture-level performance study identifies the causes for this degradation. Third, the seemingly naive maximal partition achieves best or close-to-best performance in the benchmarks studied. This article presents an analysis that explains this surprising result. Finally, address-arithmetic-based reshaping always performs better than its pointer-based counterpart.
Publisher
Association for Computing Machinery (ACM)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Data layout optimization based on the spatio-temporal model of field access;2022 5th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE);2022-04
2. A unifying abstraction for data structure splicing;Proceedings of the International Symposium on Memory Systems;2019-09-30
3. LWPTool: A Lightweight Profiler to Guide Data Layout Optimization;IEEE Transactions on Parallel and Distributed Systems;2018-11-01
4. Modular design of a factor-graph-based inference engine on a System-On-Chip (SoC);Microprocessors and Microsystems;2018-07
5. Building Efficient Query Engines in a High-Level Language;ACM Transactions on Database Systems;2018-04-11