Year: 1990
Type: article
Abstract: ABSIRACTIn this paper, we discuss a program transformation technique called array reshaping.Array reshaping is an aggressive program transformation technique that modifies the shape of the array storage at compile-time for efficient execution on parallel architectures.It can be used to minimize the local storage for local copies of data or change the patterns that arrays are stored and referenced.For shared-memory architectures, it can be used to copy subsets of arrays to local memories in blocks to speed up the data references.For distributed-memory architectures, this technique can be used to minimize conununication between processors and optimize the data storage.Array reshaping also eliminates some of the needs to hand optimize the storage space and thus allows the user to specify algorithms in a more intuitive way.Array reshaping functions and some examples and heuristics for utilizing the array reshaping are discussed.
Author: Ko‐Yang Wang
Language: English
Subfield: Hardware and Architecture
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1513833704
