Loading…
Nonsingular data transformations : Definition, validity, and applications
A unifying framework is described for nonsingular data transformations. It is shown that a wide class of existing transformations may be expressed in this framework, allowing compound transformations to be performed in one step. Validity conditions for such transformations are developed as is the fo...
Saved in:
Published in: | International journal of parallel programming 1999-06, Vol.27 (3), p.131-159 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A unifying framework is described for nonsingular data transformations. It is shown that a wide class of existing transformations may be expressed in this framework, allowing compound transformations to be performed in one step. Validity conditions for such transformations are developed as is the form of the transformed program and data. Constructive algorithms to generate data transformations for different applications are described and applied to example programs. It is shown that they can have a significant impact on program performance and may be used in situations where traditional loop transformations are inappropriate. |
---|---|
ISSN: | 0885-7458 1573-7640 |
DOI: | 10.1023/A:1018744411700 |